Filtros : "Indexado no INSPEC" "European Journal of Operational Research" Removidos: "Munari, Pedro" "Silva, Marcos Roberto" Limpar

Filtros



Refine with date range


  • 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: 09 out. 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 out. 09 ] 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 out. 09 ] 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

      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: 09 out. 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 out. 09 ] 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 out. 09 ] Available from: https://doi.org/10.1016/j.ejor.2013.10.017
  • 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: 09 out. 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 out. 09 ] 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 out. 09 ] Available from: https://doi.org/10.1016/j.ejor.2013.11.026
  • 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: 09 out. 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 out. 09 ] 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 out. 09 ] 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: 09 out. 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 out. 09 ] 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 out. 09 ] 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: 09 out. 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 out. 09 ] 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 out. 09 ] Available from: https://doi.org/10.1016/j.ejor.2011.02.016
  • 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: 09 out. 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 out. 09 ] 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 out. 09 ] Available from: https://doi.org/10.1016/j.ejor.2009.01.047
  • Source: European Journal of Operational Research. Unidade: ICMC

    Assunto: ENGENHARIA DE PRODUÇÃO

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

      SANTOS-MEZA, Elisangela dos e SANTOS, Maristela Oliveira dos e ARENALES, Marcos Nereu. A Lot-sizing problem in an automated foundry. European Journal of Operational Research, v. 139, n. 3, p. 490-500, 2002Tradução . . Disponível em: https://doi.org/10.1016/s0377-2217(01)00196-5. Acesso em: 09 out. 2024.
    • APA

      Santos-Meza, E. dos, Santos, M. O. dos, & Arenales, M. N. (2002). A Lot-sizing problem in an automated foundry. European Journal of Operational Research, 139( 3), 490-500. doi:10.1016/s0377-2217(01)00196-5
    • NLM

      Santos-Meza E dos, Santos MO dos, Arenales MN. A Lot-sizing problem in an automated foundry [Internet]. European Journal of Operational Research. 2002 ; 139( 3): 490-500.[citado 2024 out. 09 ] Available from: https://doi.org/10.1016/s0377-2217(01)00196-5
    • Vancouver

      Santos-Meza E dos, Santos MO dos, Arenales MN. A Lot-sizing problem in an automated foundry [Internet]. European Journal of Operational Research. 2002 ; 139( 3): 490-500.[citado 2024 out. 09 ] Available from: https://doi.org/10.1016/s0377-2217(01)00196-5

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