Filtros : "Financiamento PRONEX" "European Journal of Operational Research" Removidos: "Munari, Pedro" "Silva, Marcos Roberto" Limpar

Filtros



Refine with date range


  • Source: European Journal of Operational Research. Unidades: IME, EACH

    Subjects: PROGRAMAÇÃO DINÂMICA, ALGORITMOS, EMPACOTAMENTO E COBERTURA

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

      CINTRA, Glauber Ferreira et al. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research, v. 191, n. 1, p. 61-85, 2008Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2007.08.007. Acesso em: 09 out. 2024.
    • APA

      Cintra, G. F., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2008). Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research, 191( 1), 61-85. doi:10.1016/j.ejor.2007.08.007
    • NLM

      Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation [Internet]. European Journal of Operational Research. 2008 ; 191( 1): 61-85.[citado 2024 out. 09 ] Available from: https://doi.org/10.1016/j.ejor.2007.08.007
    • Vancouver

      Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation [Internet]. European Journal of Operational Research. 2008 ; 191( 1): 61-85.[citado 2024 out. 09 ] Available from: https://doi.org/10.1016/j.ejor.2007.08.007
  • Source: European Journal of Operational Research. Unidade: IME

    Subjects: PROGRAMAÇÃO MATEMÁTICA, COMBINATÓRIA, 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

      CINTRA, Glauber Ferreira et al. A note on the approximability of cutting stock problems. European Journal of Operational Research, v. 183, n. 3, p. 1328-1332, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2005.09.053. Acesso em: 09 out. 2024.
    • APA

      Cintra, G. F., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2007). A note on the approximability of cutting stock problems. European Journal of Operational Research, 183( 3), 1328-1332. doi:10.1016/j.ejor.2005.09.053
    • NLM

      Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC. A note on the approximability of cutting stock problems [Internet]. European Journal of Operational Research. 2007 ; 183( 3): 1328-1332.[citado 2024 out. 09 ] Available from: https://doi.org/10.1016/j.ejor.2005.09.053
    • Vancouver

      Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC. A note on the approximability of cutting stock problems [Internet]. European Journal of Operational Research. 2007 ; 183( 3): 1328-1332.[citado 2024 out. 09 ] Available from: https://doi.org/10.1016/j.ejor.2005.09.053
  • 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: 09 out. 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 out. 09 ] 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 out. 09 ] Available from: https://doi.org/10.1016/s0377-2217(02)00208-4
  • Source: European Journal of Operational Research. Unidade: IME

    Assunto: ALGORITMOS E ESTRUTURAS DE DADOS

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

      MIYAZAWA, Flávio Keidi e WAKABAYASHI, Yoshiko. Parametric on-line algorithms for packing rectangles and boxes. European Journal of Operational Research, v. 150, n. 2, p. 281-292, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0377-2217(02)00539-8. Acesso em: 09 out. 2024.
    • APA

      Miyazawa, F. K., & Wakabayashi, Y. (2003). Parametric on-line algorithms for packing rectangles and boxes. European Journal of Operational Research, 150( 2), 281-292. doi:10.1016/s0377-2217(02)00539-8
    • NLM

      Miyazawa FK, Wakabayashi Y. Parametric on-line algorithms for packing rectangles and boxes [Internet]. European Journal of Operational Research. 2003 ; 150( 2): 281-292.[citado 2024 out. 09 ] Available from: https://doi.org/10.1016/s0377-2217(02)00539-8
    • Vancouver

      Miyazawa FK, Wakabayashi Y. Parametric on-line algorithms for packing rectangles and boxes [Internet]. European Journal of Operational Research. 2003 ; 150( 2): 281-292.[citado 2024 out. 09 ] Available from: https://doi.org/10.1016/s0377-2217(02)00539-8

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