Filtros : "ICMC" "European Journal of Operational Research" Limpar

Filtros



Refine with date range


  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: DIÓXIDO DE CARBONO, VEÍCULOS, HEURÍSTICA, AVALIAÇÃO DE DESEMPENHO

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

      FERREIRA, Kamyla Maria et al. A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery. European Journal of Operational Research, v. 316, p. 597-616, 2024Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2024.01.049. Acesso em: 24 jul. 2024.
    • APA

      Ferreira, K. M., Queiroz, T. A. de, Munari, P., & Toledo, F. M. B. de. (2024). A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery. European Journal of Operational Research, 316, 597-616. doi:10.1016/j.ejor.2024.01.049
    • NLM

      Ferreira KM, Queiroz TA de, Munari P, Toledo FMB de. A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery [Internet]. European Journal of Operational Research. 2024 ; 316 597-616.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2024.01.049
    • Vancouver

      Ferreira KM, Queiroz TA de, Munari P, Toledo FMB de. A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery [Internet]. European Journal of Operational Research. 2024 ; 316 597-616.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2024.01.049
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: REDES COMPLEXAS, RISCO, FRAMEWORKS, FINANÇAS

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

      ALEXANDRE, Michel et al. Does the default pecking order impact systemic risk?: evidence from Brazilian data. European Journal of Operational Research, v. 309, p. 1379-1391, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2023.01.043. Acesso em: 24 jul. 2024.
    • APA

      Alexandre, M., Silva, T. C., Michalak, K., & Rodrigues, F. A. (2023). Does the default pecking order impact systemic risk?: evidence from Brazilian data. European Journal of Operational Research, 309, 1379-1391. doi:10.1016/j.ejor.2023.01.043
    • NLM

      Alexandre M, Silva TC, Michalak K, Rodrigues FA. Does the default pecking order impact systemic risk?: evidence from Brazilian data [Internet]. European Journal of Operational Research. 2023 ; 309 1379-1391.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2023.01.043
    • Vancouver

      Alexandre M, Silva TC, Michalak K, Rodrigues FA. Does the default pecking order impact systemic risk?: evidence from Brazilian data [Internet]. European Journal of Operational Research. 2023 ; 309 1379-1391.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2023.01.043
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS, ELIPSE

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

      TEDESCHI, Danilo Françoso e ANDRETTA, Marina. New exact algorithms for planar maximum covering location by ellipses problems. European Journal of Operational Research, v. 291, n. 1, p. 114-127, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2020.09.029. Acesso em: 24 jul. 2024.
    • APA

      Tedeschi, D. F., & Andretta, M. (2021). New exact algorithms for planar maximum covering location by ellipses problems. European Journal of Operational Research, 291( 1), 114-127. doi:10.1016/j.ejor.2020.09.029
    • NLM

      Tedeschi DF, Andretta M. New exact algorithms for planar maximum covering location by ellipses problems [Internet]. European Journal of Operational Research. 2021 ; 291( 1): 114-127.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2020.09.029
    • Vancouver

      Tedeschi DF, Andretta M. New exact algorithms for planar maximum covering location by ellipses problems [Internet]. European Journal of Operational Research. 2021 ; 291( 1): 114-127.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2020.09.029
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: MODELOS MATEMÁTICOS, HEURÍSTICA, PLANEJAMENTO DA PRODUÇÃO

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

      LEÃO, Aline Aparecida de Souza et al. Irregular packing problems: a review of mathematical models. European Journal of Operational Research, v. 282, n. 3, p. 803-822, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2019.04.045. Acesso em: 24 jul. 2024.
    • APA

      Leão, A. A. de S., Toledo, F. M. B. de, Oliveira, J. F., Carravilla, M. A., & Alvarez-Valdés, R. (2020). Irregular packing problems: a review of mathematical models. European Journal of Operational Research, 282( 3), 803-822. doi:10.1016/j.ejor.2019.04.045
    • NLM

      Leão AA de S, Toledo FMB de, Oliveira JF, Carravilla MA, Alvarez-Valdés R. Irregular packing problems: a review of mathematical models [Internet]. European Journal of Operational Research. 2020 ; 282( 3): 803-822.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2019.04.045
    • Vancouver

      Leão AA de S, Toledo FMB de, Oliveira JF, Carravilla MA, Alvarez-Valdés R. Irregular packing problems: a review of mathematical models [Internet]. European Journal of Operational Research. 2020 ; 282( 3): 803-822.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2019.04.045
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: ENSINO MÉDIO, HORÁRIO ESCOLAR, ALGORITMOS ÚTEIS E ESPECÍFICOS

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

      SAVINIEC, Landir et al. Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems. European Journal of Operational Research, v. 280, n. 3, p. 1064-1081, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2019.08.001. Acesso em: 24 jul. 2024.
    • APA

      Saviniec, L., Santos, M. O. dos, Costa, A. M., & Santos, L. M. R. dos. (2020). Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems. European Journal of Operational Research, 280( 3), 1064-1081. doi:10.1016/j.ejor.2019.08.001
    • NLM

      Saviniec L, Santos MO dos, Costa AM, Santos LMR dos. Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems [Internet]. European Journal of Operational Research. 2020 ; 280( 3): 1064-1081.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2019.08.001
    • Vancouver

      Saviniec L, Santos MO dos, Costa AM, Santos LMR dos. Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems [Internet]. European Journal of Operational Research. 2020 ; 280( 3): 1064-1081.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2019.08.001
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

      SAVINIEC, Landir e SANTOS, Maristela Oliveira dos e COSTA, Alysson Machado. Parallel local search algorithms for high school timetabling problems. European Journal of Operational Research, v. Fe 2018, n. 1, p. 81-98, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2017.07.029. Acesso em: 24 jul. 2024.
    • APA

      Saviniec, L., Santos, M. O. dos, & Costa, A. M. (2018). Parallel local search algorithms for high school timetabling problems. European Journal of Operational Research, Fe 2018( 1), 81-98. doi:10.1016/j.ejor.2017.07.029
    • NLM

      Saviniec L, Santos MO dos, Costa AM. Parallel local search algorithms for high school timetabling problems [Internet]. European Journal of Operational Research. 2018 ; Fe 2018( 1): 81-98.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2017.07.029
    • Vancouver

      Saviniec L, Santos MO dos, Costa AM. Parallel local search algorithms for high school timetabling problems [Internet]. European Journal of Operational Research. 2018 ; Fe 2018( 1): 81-98.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2017.07.029
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

      CUNHA, Artur Lovato da et al. An integrated approach for production lot sizing and raw material purchasing. European Journal of Operational Research, v. 269, n. 3, p. 923-938, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2018.02.042. Acesso em: 24 jul. 2024.
    • APA

      Cunha, A. L. da, Santos, M. O. dos, Morabito, R., & Ana Barbosa-Póvoa Ana Barbosa-Póvoa,. (2018). An integrated approach for production lot sizing and raw material purchasing. European Journal of Operational Research, 269( 3), 923-938. doi:10.1016/j.ejor.2018.02.042
    • NLM

      Cunha AL da, Santos MO dos, Morabito R, Ana Barbosa-Póvoa Ana Barbosa-Póvoa. An integrated approach for production lot sizing and raw material purchasing [Internet]. European Journal of Operational Research. 2018 ; 269( 3): 923-938.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2018.02.042
    • Vancouver

      Cunha AL da, Santos MO dos, Morabito R, Ana Barbosa-Póvoa Ana Barbosa-Póvoa. An integrated approach for production lot sizing and raw material purchasing [Internet]. European Journal of Operational Research. 2018 ; 269( 3): 923-938.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2018.02.042
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: ALGORITMOS, OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

      CHERRI, Luiz Henrique et al. Robust mixed-integer linear programming models for the irregular strip packing problem. European Journal of Operational Research, v. 253, n. 3, p. 570-583, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2016.03.009. Acesso em: 24 jul. 2024.
    • APA

      Cherri, L. H., Mundim, L. R., Andretta, M., Toledo, F. M. B. de, Oliveira, J. F., & Carravilla, M. A. (2016). Robust mixed-integer linear programming models for the irregular strip packing problem. European Journal of Operational Research, 253( 3), 570-583. doi:10.1016/j.ejor.2016.03.009
    • NLM

      Cherri LH, Mundim LR, Andretta M, Toledo FMB de, Oliveira JF, Carravilla MA. Robust mixed-integer linear programming models for the irregular strip packing problem [Internet]. European Journal of Operational Research. 2016 ; 253( 3): 570-583.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2016.03.009
    • Vancouver

      Cherri LH, Mundim LR, Andretta M, Toledo FMB de, Oliveira JF, Carravilla MA. Robust mixed-integer linear programming models for the irregular strip packing problem [Internet]. European Journal of Operational Research. 2016 ; 253( 3): 570-583.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2016.03.009
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

      CHERRI, Adriana Cristina et al. The one-dimensional cutting stock problem with usable leftovers: a survey. European Journal of Operational Research, v. 236, n. 2, p. 395-402, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2013.11.026. Acesso em: 24 jul. 2024.
    • APA

      Cherri, A. C., Arenales, M. N., Yanasse, H. H., Poldi, K. C., & Vianna, A. C. G. (2014). The one-dimensional cutting stock problem with usable leftovers: a survey. European Journal of Operational Research, 236( 2), 395-402. doi:10.1016/j.ejor.2013.11.026
    • NLM

      Cherri AC, Arenales MN, Yanasse HH, Poldi KC, Vianna ACG. The one-dimensional cutting stock problem with usable leftovers: a survey [Internet]. European Journal of Operational Research. 2014 ; 236( 2): 395-402.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2013.11.026
    • Vancouver

      Cherri AC, Arenales MN, Yanasse HH, Poldi KC, Vianna ACG. The one-dimensional cutting stock problem with usable leftovers: a survey [Internet]. European Journal of Operational Research. 2014 ; 236( 2): 395-402.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2013.11.026
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

      CAMARGO, Victor C. B e TOLEDO, Franklina Maria Bragion de e ALMADA-LOBO, Bernardo. HOPS: Hamming-Oriented Partition search for production planning in the spinning industry. European Journal of Operational Research, v. 234, n. 1, p. 266-277, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2013.10.017. Acesso em: 24 jul. 2024.
    • APA

      Camargo, V. C. B., Toledo, F. M. B. de, & Almada-Lobo, B. (2014). HOPS: Hamming-Oriented Partition search for production planning in the spinning industry. European Journal of Operational Research, 234( 1), 266-277. doi:10.1016/j.ejor.2013.10.017
    • NLM

      Camargo VCB, Toledo FMB de, Almada-Lobo B. HOPS: Hamming-Oriented Partition search for production planning in the spinning industry [Internet]. European Journal of Operational Research. 2014 ; 234( 1): 266-277.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2013.10.017
    • Vancouver

      Camargo VCB, Toledo FMB de, Almada-Lobo B. HOPS: Hamming-Oriented Partition search for production planning in the spinning industry [Internet]. European Journal of Operational Research. 2014 ; 234( 1): 266-277.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2013.10.017
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: PESQUISA OPERACIONAL, OTIMIZAÇÃO COMBINATÓRIA, HEURÍSTICA, VEÍCULOS

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

      OLIVEIRA, Beatriz Brito et al. A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company. European Journal of Operational Research, v. 237, n. 2, p. Se 2014, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2014.02.018. Acesso em: 24 jul. 2024.
    • APA

      Oliveira, B. B., Carravilla, M. A., Oliveira, J. F., & Toledo, F. M. B. de. (2014). A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company. European Journal of Operational Research, 237( 2), Se 2014. doi:10.1016/j.ejor.2014.02.018
    • NLM

      Oliveira BB, Carravilla MA, Oliveira JF, Toledo FMB de. A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company [Internet]. European Journal of Operational Research. 2014 ; 237( 2): Se 2014.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2014.02.018
    • Vancouver

      Oliveira BB, Carravilla MA, Oliveira JF, Toledo FMB de. A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company [Internet]. European Journal of Operational Research. 2014 ; 237( 2): Se 2014.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2014.02.018
  • Source: European Journal of Operational Research. Unidades: ICMC, IME

    Assunto: ALGORITMOS

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

      ANDRETTA, Marina e BIRGIN, Ernesto Julian Goldberg. Deterministic and stochastic global optimization techniques for planar covering with ellipses problems. European Journal of Operational Research, v. 224, n. 1, p. 23\201340, 2013Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2012.07.020. Acesso em: 24 jul. 2024.
    • APA

      Andretta, M., & Birgin, E. J. G. (2013). Deterministic and stochastic global optimization techniques for planar covering with ellipses problems. European Journal of Operational Research, 224( 1), 23\201340. doi:10.1016/j.ejor.2012.07.020
    • NLM

      Andretta M, Birgin EJG. Deterministic and stochastic global optimization techniques for planar covering with ellipses problems [Internet]. European Journal of Operational Research. 2013 ; 224( 1): 23\201340.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2012.07.020
    • Vancouver

      Andretta M, Birgin EJG. Deterministic and stochastic global optimization techniques for planar covering with ellipses problems [Internet]. European Journal of Operational Research. 2013 ; 224( 1): 23\201340.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2012.07.020
  • Source: European Journal of Operational Research. Unidade: ICMC

    Assunto: INTELIGÊNCIA ARTIFICIAL

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

      NASCIMENTO, Mariá Cristina Vasconcelos e CARVALHO, André Carlos Ponce de Leon Ferreira de. Spectral methods for graph clustering: a survey. European Journal of Operational Research, v. 211, n. Ju 2011, p. 221-231, 2011Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2010.08.012. Acesso em: 24 jul. 2024.
    • APA

      Nascimento, M. C. V., & Carvalho, A. C. P. de L. F. de. (2011). Spectral methods for graph clustering: a survey. European Journal of Operational Research, 211( Ju 2011), 221-231. doi:10.1016/j.ejor.2010.08.012
    • NLM

      Nascimento MCV, Carvalho ACP de LF de. Spectral methods for graph clustering: a survey [Internet]. European Journal of Operational Research. 2011 ; 211( Ju 2011): 221-231.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2010.08.012
    • Vancouver

      Nascimento MCV, Carvalho ACP de LF de. Spectral methods for graph clustering: a survey [Internet]. European Journal of Operational Research. 2011 ; 211( Ju 2011): 221-231.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2010.08.012
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

      LEÃO, Aline Aparecida de Souza et al. The constrained compartmentalized knapsack problem: mathematical models and solution methods. European Journal of Operational Research, v. 212, n. 3, p. 455\2013463, 2011Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2011.02.016. Acesso em: 24 jul. 2024.
    • APA

      Leão, A. A. de S., Santos, M. O. dos, Hoto, R. S. V., & Arenales, M. N. (2011). The constrained compartmentalized knapsack problem: mathematical models and solution methods. European Journal of Operational Research, 212( 3), 455\2013463. doi:10.1016/j.ejor.2011.02.016
    • NLM

      Leão AA de S, Santos MO dos, Hoto RSV, Arenales MN. The constrained compartmentalized knapsack problem: mathematical models and solution methods [Internet]. European Journal of Operational Research. 2011 ; 212( 3): 455\2013463.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2011.02.016
    • Vancouver

      Leão AA de S, Santos MO dos, Hoto RSV, Arenales MN. The constrained compartmentalized knapsack problem: mathematical models and solution methods [Internet]. European Journal of Operational Research. 2011 ; 212( 3): 455\2013463.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2011.02.016
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

      SANTOS, Lana Mara Rodrigues dos et al. Sustainable vegetable crop supply problem. European Journal of Operational Research, v. 204, n. 3, p. 639-647, 2010Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2009.11.026. Acesso em: 24 jul. 2024.
    • APA

      Santos, L. M. R. dos, Costa, A. M., Arenales, M. N., & Santos, R. H. S. (2010). Sustainable vegetable crop supply problem. European Journal of Operational Research, 204( 3), 639-647. doi:10.1016/j.ejor.2009.11.026
    • NLM

      Santos LMR dos, Costa AM, Arenales MN, Santos RHS. Sustainable vegetable crop supply problem [Internet]. European Journal of Operational Research. 2010 ; 204( 3): 639-647.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2009.11.026
    • Vancouver

      Santos LMR dos, Costa AM, Arenales MN, Santos RHS. Sustainable vegetable crop supply problem [Internet]. European Journal of Operational Research. 2010 ; 204( 3): 639-647.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2009.11.026
  • Source: European Journal of Operational Research. Unidade: ICMC

    Assunto: INTELIGÊNCIA ARTIFICIAL

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

      NASCIMENTO, Mariá Cristina Vasconcelos e RESENDE, Mauricio G. C. e TOLEDO, Franklina Maria Bragion de. GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem. European Journal of Operational Research, v. 200, n. 3, p. 747-754, 2010Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2009.01.047. Acesso em: 24 jul. 2024.
    • APA

      Nascimento, M. C. V., Resende, M. G. C., & Toledo, F. M. B. de. (2010). GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem. European Journal of Operational Research, 200( 3), 747-754. doi:10.1016/j.ejor.2009.01.047
    • NLM

      Nascimento MCV, Resende MGC, Toledo FMB de. GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem [Internet]. European Journal of Operational Research. 2010 ; 200( 3): 747-754.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2009.01.047
    • Vancouver

      Nascimento MCV, Resende MGC, Toledo FMB de. GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem [Internet]. European Journal of Operational Research. 2010 ; 200( 3): 747-754.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2009.01.047
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

      RITT, Marcus et al. An integer linear programming approach for approximate string comparison. European Journal of Operational Research, v. 198, n. 3, p. 706-714, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2008.10.013. Acesso em: 24 jul. 2024.
    • APA

      Ritt, M., Costa, A. M., Mergenhagen, S. E., Mergen, S., & Orengo, V. M. (2009). An integer linear programming approach for approximate string comparison. European Journal of Operational Research, 198( 3), 706-714. doi:10.1016/j.ejor.2008.10.013
    • NLM

      Ritt M, Costa AM, Mergenhagen SE, Mergen S, Orengo VM. An integer linear programming approach for approximate string comparison [Internet]. European Journal of Operational Research. 2009 ; 198( 3): 706-714.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2008.10.013
    • Vancouver

      Ritt M, Costa AM, Mergenhagen SE, Mergen S, Orengo VM. An integer linear programming approach for approximate string comparison [Internet]. European Journal of Operational Research. 2009 ; 198( 3): 706-714.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2008.10.013
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

      CHERRI, Adriana Cristina e ARENALES, Marcos Nereu e YANASSE, Horacio Hideki. The one dimensional cutting stock problem with usable leftover: a heuristic approach. European Journal of Operational Research, v. 196, p. 897-908, 2009Tradução . . Disponível em: http://www.sciencedirect.com/science/journal/03772217. Acesso em: 24 jul. 2024.
    • APA

      Cherri, A. C., Arenales, M. N., & Yanasse, H. H. (2009). The one dimensional cutting stock problem with usable leftover: a heuristic approach. European Journal of Operational Research, 196, 897-908. Recuperado de http://www.sciencedirect.com/science/journal/03772217
    • NLM

      Cherri AC, Arenales MN, Yanasse HH. The one dimensional cutting stock problem with usable leftover: a heuristic approach [Internet]. European Journal of Operational Research. 2009 ; 196 897-908.[citado 2024 jul. 24 ] Available from: http://www.sciencedirect.com/science/journal/03772217
    • Vancouver

      Cherri AC, Arenales MN, Yanasse HH. The one dimensional cutting stock problem with usable leftover: a heuristic approach [Internet]. European Journal of Operational Research. 2009 ; 196 897-908.[citado 2024 jul. 24 ] Available from: http://www.sciencedirect.com/science/journal/03772217
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: HEURÍSTICA, REDES DE COMPUTADORES

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

      COSTA, Alysson Machado e CORDEAU, Jean-François e LAPORTE, Gilbert. Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints. European Journal of Operational Research, v. 190, n. 1, p. 68-78, 2008Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2007.06.012. Acesso em: 24 jul. 2024.
    • APA

      Costa, A. M., Cordeau, J. -F., & Laporte, G. (2008). Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints. European Journal of Operational Research, 190( 1), 68-78. doi:10.1016/j.ejor.2007.06.012
    • NLM

      Costa AM, Cordeau J-F, Laporte G. Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints [Internet]. European Journal of Operational Research. 2008 ; 190( 1): 68-78.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2007.06.012
    • Vancouver

      Costa AM, Cordeau J-F, Laporte G. Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints [Internet]. European Journal of Operational Research. 2008 ; 190( 1): 68-78.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1016/j.ejor.2007.06.012
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

      BALBO, Antonio Roberto e BAPTISTA, Edméa Cássia e ARENALES, Marcos Nereu. An adaptation of the dual-affine interior point method for the surface flatness problem. European Journal of Operational Research, v. 181, p. 1607-1616, 2007Tradução . . Disponível em: http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VCT-4K42DMB-1&_user=5674931&_coverDate=09%2F16%2F2007&_alid=676025808&_rdoc=1&_fmt=full&_orig=search&_cdi=5963&_sort=d&_docanchor=&view=c&_ct=1&_acct=C000049650&_version=1&_urlVersion=0&_userid=5674931&md5=632703316dc7313c003e5b8614878acf. Acesso em: 24 jul. 2024.
    • APA

      Balbo, A. R., Baptista, E. C., & Arenales, M. N. (2007). An adaptation of the dual-affine interior point method for the surface flatness problem. European Journal of Operational Research, 181, 1607-1616. Recuperado de http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VCT-4K42DMB-1&_user=5674931&_coverDate=09%2F16%2F2007&_alid=676025808&_rdoc=1&_fmt=full&_orig=search&_cdi=5963&_sort=d&_docanchor=&view=c&_ct=1&_acct=C000049650&_version=1&_urlVersion=0&_userid=5674931&md5=632703316dc7313c003e5b8614878acf
    • NLM

      Balbo AR, Baptista EC, Arenales MN. An adaptation of the dual-affine interior point method for the surface flatness problem [Internet]. European Journal of Operational Research. 2007 ; 181 1607-1616.[citado 2024 jul. 24 ] Available from: http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VCT-4K42DMB-1&_user=5674931&_coverDate=09%2F16%2F2007&_alid=676025808&_rdoc=1&_fmt=full&_orig=search&_cdi=5963&_sort=d&_docanchor=&view=c&_ct=1&_acct=C000049650&_version=1&_urlVersion=0&_userid=5674931&md5=632703316dc7313c003e5b8614878acf
    • Vancouver

      Balbo AR, Baptista EC, Arenales MN. An adaptation of the dual-affine interior point method for the surface flatness problem [Internet]. European Journal of Operational Research. 2007 ; 181 1607-1616.[citado 2024 jul. 24 ] Available from: http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VCT-4K42DMB-1&_user=5674931&_coverDate=09%2F16%2F2007&_alid=676025808&_rdoc=1&_fmt=full&_orig=search&_cdi=5963&_sort=d&_docanchor=&view=c&_ct=1&_acct=C000049650&_version=1&_urlVersion=0&_userid=5674931&md5=632703316dc7313c003e5b8614878acf

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