Filtros : "Inglês" "EP-PRO" "IME-MAC" Limpar

Filtros



Refine with date range


  • Source: Expert Systems with Applications. Unidades: IME, EP

    Subjects: PESQUISA OPERACIONAL, TEORIA DE SISTEMAS E CONTROLE, PROGRAMAÇÃO LINEAR

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg e ROMÃO, Oberlan Christo e RONCONI, Débora Pretti. A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers. Expert Systems with Applications, v. 223, p. 26 on-line, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.eswa.2023.119866. Acesso em: 18 ago. 2024.
    • APA

      Birgin, E. J. G., Romão, O. C., & Ronconi, D. P. (2023). A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers. Expert Systems with Applications, 223, 26 on-line. doi:10.1016/j.eswa.2023.119866
    • NLM

      Birgin EJG, Romão OC, Ronconi DP. A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers [Internet]. Expert Systems with Applications. 2023 ; 223 26 on-line.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.eswa.2023.119866
    • Vancouver

      Birgin EJG, Romão OC, Ronconi DP. A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers [Internet]. Expert Systems with Applications. 2023 ; 223 26 on-line.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.eswa.2023.119866
  • Source: Operations Research Forum. Unidades: IME, EP

    Subjects: PROGRAMAÇÃO LINEAR, CONTROLE DA PRODUÇÃO, PLANEJAMENTO DA PRODUÇÃO

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ARAUJO, Kennedy Anderson Guimarães de et al. Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry. Operations Research Forum, v. 4, n. artigo 47, p. 1-30, 2023Tradução . . Disponível em: https://doi.org/10.1007/s43069-023-00230-7. Acesso em: 18 ago. 2024.
    • APA

      Araujo, K. A. G. de, Birgin, E. J. G., Kawamura, M. S., & Ronconi, D. P. (2023). Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry. Operations Research Forum, 4( artigo 47), 1-30. doi:10.1007/s43069-023-00230-7
    • NLM

      Araujo KAG de, Birgin EJG, Kawamura MS, Ronconi DP. Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry [Internet]. Operations Research Forum. 2023 ; 4( artigo 47): 1-30.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1007/s43069-023-00230-7
    • Vancouver

      Araujo KAG de, Birgin EJG, Kawamura MS, Ronconi DP. Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry [Internet]. Operations Research Forum. 2023 ; 4( artigo 47): 1-30.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1007/s43069-023-00230-7
  • Source: Anais. Conference titles: Simpósio Brasileiro de Pesquisa Operacional - SBPO. Unidades: IME, EP

    Subjects: PROGRAMAÇÃO LINEAR, OTIMIZAÇÃO COMBINATÓRIA, PROGRAMAÇÃO MATEMÁTICA

    Versão PublicadaAcesso à fonteHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ARAUJO, Kennedy Anderson Guimarães de e BIRGIN, Ernesto Julian Goldberg e RONCONI, Débora Pretti. A constraint programming model for the flexible job shop scheduling problem with sequencing flexibility and position based learning effects. 2022, Anais.. Rio de Janeiro: SOBRAPO, 2022. Disponível em: https://proceedings.science/sbpo/sbpo-2022/trabalhos/a-constraint-programming-model-for-the-flexible-job-shop-scheduling-problem-with?lang=pt-br. Acesso em: 18 ago. 2024.
    • APA

      Araujo, K. A. G. de, Birgin, E. J. G., & Ronconi, D. P. (2022). A constraint programming model for the flexible job shop scheduling problem with sequencing flexibility and position based learning effects. In Anais. Rio de Janeiro: SOBRAPO. Recuperado de https://proceedings.science/sbpo/sbpo-2022/trabalhos/a-constraint-programming-model-for-the-flexible-job-shop-scheduling-problem-with?lang=pt-br
    • NLM

      Araujo KAG de, Birgin EJG, Ronconi DP. A constraint programming model for the flexible job shop scheduling problem with sequencing flexibility and position based learning effects [Internet]. Anais. 2022 ;[citado 2024 ago. 18 ] Available from: https://proceedings.science/sbpo/sbpo-2022/trabalhos/a-constraint-programming-model-for-the-flexible-job-shop-scheduling-problem-with?lang=pt-br
    • Vancouver

      Araujo KAG de, Birgin EJG, Ronconi DP. A constraint programming model for the flexible job shop scheduling problem with sequencing flexibility and position based learning effects [Internet]. Anais. 2022 ;[citado 2024 ago. 18 ] Available from: https://proceedings.science/sbpo/sbpo-2022/trabalhos/a-constraint-programming-model-for-the-flexible-job-shop-scheduling-problem-with?lang=pt-br
  • Source: European Journal of Operational Research. Unidades: IME, EP

    Subjects: PROGRAMAÇÃO MATEMÁTICA, SCHEDULING

    Versão AceitaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      LUNARDI, Willian Tessaro et al. Metaheuristics for the online printing shop scheduling problem. European Journal of Operational Research, v. 293, n. 2, p. 419-441, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2020.12.021. Acesso em: 18 ago. 2024.
    • APA

      Lunardi, W. T., Birgin, E. J. G., Ronconi, D. P., & Voos, H. (2021). Metaheuristics for the online printing shop scheduling problem. European Journal of Operational Research, 293( 2), 419-441. doi:10.1016/j.ejor.2020.12.021
    • NLM

      Lunardi WT, Birgin EJG, Ronconi DP, Voos H. Metaheuristics for the online printing shop scheduling problem [Internet]. European Journal of Operational Research. 2021 ; 293( 2): 419-441.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.021
    • Vancouver

      Lunardi WT, Birgin EJG, Ronconi DP, Voos H. Metaheuristics for the online printing shop scheduling problem [Internet]. European Journal of Operational Research. 2021 ; 293( 2): 419-441.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.021
  • Source: Computers & Operations Research. Unidades: IME, EP

    Subjects: ALGORITMOS DE SCHEDULING, HEURÍSTICA, PROGRAMAÇÃO DA PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg e JESUS FILHO, José Eurípedes Ferreira de e RONCONI, Débora Pretti. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs. Computers & Operations Research, v. 114, n. 1-14, p. 104824, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2019.104824. Acesso em: 18 ago. 2024.
    • APA

      Birgin, E. J. G., Jesus Filho, J. E. F. de, & Ronconi, D. P. (2020). A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs. Computers & Operations Research, 114( 1-14), 104824. doi:10.1016/j.cor.2019.104824
    • NLM

      Birgin EJG, Jesus Filho JEF de, Ronconi DP. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs [Internet]. Computers & Operations Research. 2020 ; 114( 1-14): 104824.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.cor.2019.104824
    • Vancouver

      Birgin EJG, Jesus Filho JEF de, Ronconi DP. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs [Internet]. Computers & Operations Research. 2020 ; 114( 1-14): 104824.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.cor.2019.104824
  • Source: International Transactions in Operational Research. Unidades: IME, EP

    Assunto: PROGRAMAÇÃO LINEAR

    Versão AceitaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg e ROMÃO, Oberlan Christo e RONCONI, Débora Pretti. The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers. International Transactions in Operational Research, v. 27, n. 3, p. 1392-1418, 2020Tradução . . Disponível em: https://doi.org/10.1111/itor.12648. Acesso em: 18 ago. 2024.
    • APA

      Birgin, E. J. G., Romão, O. C., & Ronconi, D. P. (2020). The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers. International Transactions in Operational Research, 27( 3), 1392-1418. doi:10.1111/itor.12648
    • NLM

      Birgin EJG, Romão OC, Ronconi DP. The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers [Internet]. International Transactions in Operational Research. 2020 ; 27( 3): 1392-1418.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1111/itor.12648
    • Vancouver

      Birgin EJG, Romão OC, Ronconi DP. The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers [Internet]. International Transactions in Operational Research. 2020 ; 27( 3): 1392-1418.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1111/itor.12648
  • Source: Computers & Operations Research. Unidades: IME, EP

    Subjects: ALGORITMOS DE SCHEDULING, HEURÍSTICA

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      LUNARDI, Willian Tessaro et al. Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem. Computers & Operations Research, v. 123, p. 1-20, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2020.105020. Acesso em: 18 ago. 2024.
    • APA

      Lunardi, W. T., Birgin, E. J. G., Laborie, P., Ronconi, D. P., & Voos, H. (2020). Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem. Computers & Operations Research, 123, 1-20. doi:10.1016/j.cor.2020.105020
    • NLM

      Lunardi WT, Birgin EJG, Laborie P, Ronconi DP, Voos H. Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem [Internet]. Computers & Operations Research. 2020 ; 123 1-20.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.cor.2020.105020
    • Vancouver

      Lunardi WT, Birgin EJG, Laborie P, Ronconi DP, Voos H. Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem [Internet]. Computers & Operations Research. 2020 ; 123 1-20.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.cor.2020.105020
  • Source: European Journal of Operational Research. Unidades: IME, EP

    Subjects: ALGORITMOS DE SCHEDULING, PESQUISA OPERACIONAL, CIÊNCIA DA COMPUTAÇÃO

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg e JESUS FILHO, José Eurípedes Ferreira de e RONCONI, Débora Pretti. List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility. European Journal of Operational Research, v. 247, n. 2, p. 421-440, 2015Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2015.06.023. Acesso em: 18 ago. 2024.
    • APA

      Birgin, E. J. G., Jesus Filho, J. E. F. de, & Ronconi, D. P. (2015). List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility. European Journal of Operational Research, 247( 2), 421-440. doi:10.1016/j.ejor.2015.06.023
    • NLM

      Birgin EJG, Jesus Filho JEF de, Ronconi DP. List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility [Internet]. European Journal of Operational Research. 2015 ; 247( 2): 421-440.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.ejor.2015.06.023
    • Vancouver

      Birgin EJG, Jesus Filho JEF de, Ronconi DP. List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility [Internet]. European Journal of Operational Research. 2015 ; 247( 2): 421-440.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.ejor.2015.06.023
  • Source: Expert Systems with Applications. Unidades: EP, IME

    Subjects: HEURÍSTICA, OTIMIZAÇÃO COMBINATÓRIA, COMBINATÓRIA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      SAKURABA, Celso Satoshi et al. Metaheuristics for large-scale instances of the linear ordering problem. Expert Systems with Applications, v. 42, n. 9, p. 4432-4442, 2015Tradução . . Disponível em: https://doi.org/10.1016/j.eswa.2015.01.053. Acesso em: 18 ago. 2024.
    • APA

      Sakuraba, C. S., Ronconi, D. P., Birgin, E. J. G., & Yagiura, M. (2015). Metaheuristics for large-scale instances of the linear ordering problem. Expert Systems with Applications, 42( 9), 4432-4442. doi:10.1016/j.eswa.2015.01.053
    • NLM

      Sakuraba CS, Ronconi DP, Birgin EJG, Yagiura M. Metaheuristics for large-scale instances of the linear ordering problem [Internet]. Expert Systems with Applications. 2015 ; 42( 9): 4432-4442.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.eswa.2015.01.053
    • Vancouver

      Sakuraba CS, Ronconi DP, Birgin EJG, Yagiura M. Metaheuristics for large-scale instances of the linear ordering problem [Internet]. Expert Systems with Applications. 2015 ; 42( 9): 4432-4442.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.eswa.2015.01.053
  • Source: Journal of the Operational Research Society. Unidades: IME, EP

    Subjects: PROGRAMAÇÃO MATEMÁTICA, OTIMIZAÇÃO MATEMÁTICA, PLANEJAMENTO DA PRODUÇÃO, CONTROLE DA PRODUÇÃO

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ANDRADE, Ricardo et al. MIP models for two-dimensional non-guillotine cutting problems with usable leftovers. Journal of the Operational Research Society, v. 65, n. 11, p. 1649-1663, 2014Tradução . . Disponível em: https://doi.org/10.1057/jors.2013.108. Acesso em: 18 ago. 2024.
    • APA

      Andrade, R., Birgin, E. J. G., Morabito, R., & Ronconi, D. P. (2014). MIP models for two-dimensional non-guillotine cutting problems with usable leftovers. Journal of the Operational Research Society, 65( 11), 1649-1663. doi:10.1057/jors.2013.108
    • NLM

      Andrade R, Birgin EJG, Morabito R, Ronconi DP. MIP models for two-dimensional non-guillotine cutting problems with usable leftovers [Internet]. Journal of the Operational Research Society. 2014 ; 65( 11): 1649-1663.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1057/jors.2013.108
    • Vancouver

      Andrade R, Birgin EJG, Morabito R, Ronconi DP. MIP models for two-dimensional non-guillotine cutting problems with usable leftovers [Internet]. Journal of the Operational Research Society. 2014 ; 65( 11): 1649-1663.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1057/jors.2013.108
  • Source: Optimization Letters. Unidades: IME, EP

    Subjects: SCHEDULING, HEURÍSTICA, PROGRAMAÇÃO DA PRODUÇÃO

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg et al. A MILP model for an extended version of the Flexible Job Shop Problem. Optimization Letters, v. 8, n. 4, p. 1417\20131431, 2014Tradução . . Disponível em: https://doi.org/10.1007/s11590-013-0669-7. Acesso em: 18 ago. 2024.
    • APA

      Birgin, E. J. G., Feofiloff, P., Fernandes, C. G., Melo, E. L. de, Oshiro, M. T. I., & Ronconi, D. P. (2014). A MILP model for an extended version of the Flexible Job Shop Problem. Optimization Letters, 8( 4), 1417\20131431. doi:10.1007/s11590-013-0669-7
    • NLM

      Birgin EJG, Feofiloff P, Fernandes CG, Melo EL de, Oshiro MTI, Ronconi DP. A MILP model for an extended version of the Flexible Job Shop Problem [Internet]. Optimization Letters. 2014 ; 8( 4): 1417\20131431.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1007/s11590-013-0669-7
    • Vancouver

      Birgin EJG, Feofiloff P, Fernandes CG, Melo EL de, Oshiro MTI, Ronconi DP. A MILP model for an extended version of the Flexible Job Shop Problem [Internet]. Optimization Letters. 2014 ; 8( 4): 1417\20131431.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1007/s11590-013-0669-7
  • Source: Engineering Optimization. Unidades: IME, EP

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, SCHEDULING

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg e RONCONI, Débora Pretti. Heuristic methods for the single machine scheduling problem with different ready times and a common due date. Engineering Optimization, v. 44, n. 10, p. 1197-1208, 2012Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2011.634409. Acesso em: 18 ago. 2024.
    • APA

      Birgin, E. J. G., & Ronconi, D. P. (2012). Heuristic methods for the single machine scheduling problem with different ready times and a common due date. Engineering Optimization, 44( 10), 1197-1208. doi:10.1080/0305215X.2011.634409
    • NLM

      Birgin EJG, Ronconi DP. Heuristic methods for the single machine scheduling problem with different ready times and a common due date [Internet]. Engineering Optimization. 2012 ; 44( 10): 1197-1208.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1080/0305215X.2011.634409
    • Vancouver

      Birgin EJG, Ronconi DP. Heuristic methods for the single machine scheduling problem with different ready times and a common due date [Internet]. Engineering Optimization. 2012 ; 44( 10): 1197-1208.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1080/0305215X.2011.634409
  • Source: Just-in-time systems. Unidades: EP, IME

    Assunto: PROGRAMAÇÃO MATEMÁTICA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      RONCONI, Débora Pretti e BIRGIN, Ernesto Julian Goldberg. Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness. Just-in-time systems. Tradução . New York: Springer, 2012. . Disponível em: https://doi.org/10.1007/978-1-4614-1123-9_5. Acesso em: 18 ago. 2024.
    • APA

      Ronconi, D. P., & Birgin, E. J. G. (2012). Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness. In Just-in-time systems. New York: Springer. doi:10.1007/978-1-4614-1123-9_5
    • NLM

      Ronconi DP, Birgin EJG. Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness [Internet]. In: Just-in-time systems. New York: Springer; 2012. [citado 2024 ago. 18 ] Available from: https://doi.org/10.1007/978-1-4614-1123-9_5
    • Vancouver

      Ronconi DP, Birgin EJG. Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness [Internet]. In: Just-in-time systems. New York: Springer; 2012. [citado 2024 ago. 18 ] Available from: https://doi.org/10.1007/978-1-4614-1123-9_5
  • Source: Journal of the Operational Research Society. Unidades: IME, EP

    Assunto: PROGRAMAÇÃO LINEAR

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg et al. Method of sentinels for packing items within arbitrary convex regions. Journal of the Operational Research Society, v. 57, n. 6, p. 735-746, 2006Tradução . . Disponível em: https://doi.org/10.1057/palgrave.jors.2602067. Acesso em: 18 ago. 2024.
    • APA

      Birgin, E. J. G., Martinez, J. M., Mascarenhas, W. F., & Ronconi, D. P. (2006). Method of sentinels for packing items within arbitrary convex regions. Journal of the Operational Research Society, 57( 6), 735-746. doi:10.1057/palgrave.jors.2602067
    • NLM

      Birgin EJG, Martinez JM, Mascarenhas WF, Ronconi DP. Method of sentinels for packing items within arbitrary convex regions [Internet]. Journal of the Operational Research Society. 2006 ; 57( 6): 735-746.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1057/palgrave.jors.2602067
    • Vancouver

      Birgin EJG, Martinez JM, Mascarenhas WF, Ronconi DP. Method of sentinels for packing items within arbitrary convex regions [Internet]. Journal of the Operational Research Society. 2006 ; 57( 6): 735-746.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1057/palgrave.jors.2602067
  • Source: Computers and Operations Research. Unidades: IME, EP

    Assunto: PROGRAMAÇÃO NÃO LINEAR

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg et al. Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization. Computers and Operations Research, v. 33, n. 12, p. 3535-3548, 2006Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2005.03.031. Acesso em: 18 ago. 2024.
    • APA

      Birgin, E. J. G., Martínez, J. M., Nishihara, F. H., & Ronconi, D. P. (2006). Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization. Computers and Operations Research, 33( 12), 3535-3548. doi:10.1016/j.cor.2005.03.031
    • NLM

      Birgin EJG, Martínez JM, Nishihara FH, Ronconi DP. Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization [Internet]. Computers and Operations Research. 2006 ; 33( 12): 3535-3548.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.cor.2005.03.031
    • Vancouver

      Birgin EJG, Martínez JM, Nishihara FH, Ronconi DP. Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization [Internet]. Computers and Operations Research. 2006 ; 33( 12): 3535-3548.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.cor.2005.03.031
  • Source: European Journal of Operational Research. Unidades: IME, EP

    Subjects: OTIMIZAÇÃO MATEMÁTICA, OTIMIZAÇÃO NÃO LINEAR, PROGRAMAÇÃO NÃO LINEAR

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg e RONCONI, Débora Pretti e MARTINEZ, Jesus Manuel. Optimizing the packing of cylinders into a rectangular container: a nonlinear approach. European Journal of Operational Research, v. 160, n. 1, p. 19-33, 2005Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2003.06.018. Acesso em: 18 ago. 2024.
    • APA

      Birgin, E. J. G., Ronconi, D. P., & Martinez, J. M. (2005). Optimizing the packing of cylinders into a rectangular container: a nonlinear approach. European Journal of Operational Research, 160( 1), 19-33. doi:10.1016/j.ejor.2003.06.018
    • NLM

      Birgin EJG, Ronconi DP, Martinez JM. Optimizing the packing of cylinders into a rectangular container: a nonlinear approach [Internet]. European Journal of Operational Research. 2005 ; 160( 1): 19-33.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.ejor.2003.06.018
    • Vancouver

      Birgin EJG, Ronconi DP, Martinez JM. Optimizing the packing of cylinders into a rectangular container: a nonlinear approach [Internet]. European Journal of Operational Research. 2005 ; 160( 1): 19-33.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.ejor.2003.06.018
  • Source: European Journal of Operational Research. Unidades: IME, EP

    Subjects: PROGRAMAÇÃO NÃO LINEAR, HEURÍSTICA, ALGORITMOS DE APROXIMAÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg e MARTÍNEZ, José Mário e RONCONI, Débora Pretti. Minimization subproblems and heuristics for an applied clustering problem. European Journal of Operational Research, v. 146, n. 1, p. 19-34, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0377-2217(02)00208-4. Acesso em: 18 ago. 2024.
    • APA

      Birgin, E. J. G., Martínez, J. M., & Ronconi, D. P. (2003). Minimization subproblems and heuristics for an applied clustering problem. European Journal of Operational Research, 146( 1), 19-34. doi:10.1016/s0377-2217(02)00208-4
    • NLM

      Birgin EJG, Martínez JM, Ronconi DP. Minimization subproblems and heuristics for an applied clustering problem [Internet]. European Journal of Operational Research. 2003 ; 146( 1): 19-34.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/s0377-2217(02)00208-4
    • Vancouver

      Birgin EJG, Martínez JM, Ronconi DP. Minimization subproblems and heuristics for an applied clustering problem [Internet]. European Journal of Operational Research. 2003 ; 146( 1): 19-34.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/s0377-2217(02)00208-4

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024