Menu

Filtros : "Indexado no ISI Web of Knowledge" "ALGORITMOS" Removido: "Journal of Differential Equations" Limpar

Filtros

Refine with date range

  • 1

1 - 3 (3 records)

  • Artigo de periodico

    Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (2012)

    Queiroz, Thomaz A; Miyazawa, Flavio Keidi; Wakabayashi, Yoshiko ; Xavier, Eduardo C

    Source: Computers & Operations Research. Unidade: IME

    Assunto: ALGORITMOS

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

    • ABNT

      QUEIROZ, Thomaz A et al. Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing. Computers & Operations Research, v. 39, n. 2, p. 200-212, 2012Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2011.03.011. Acesso em: 05 dez. 2025.

    • APA

      Queiroz, T. A., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2012). Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing. Computers & Operations Research, 39( 2), 200-212. doi:10.1016/j.cor.2011.03.011

    • NLM

      Queiroz TA, Miyazawa FK, Wakabayashi Y, Xavier EC. Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing [Internet]. Computers & Operations Research. 2012 ; 39( 2): 200-212.[citado 2025 dez. 05 ] Available from: https://doi.org/10.1016/j.cor.2011.03.011

    • Vancouver

      Queiroz TA, Miyazawa FK, Wakabayashi Y, Xavier EC. Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing [Internet]. Computers & Operations Research. 2012 ; 39( 2): 200-212.[citado 2025 dez. 05 ] Available from: https://doi.org/10.1016/j.cor.2011.03.011

  • Trabalho de evento-resumo periodico

    Approximating the discrete resource sharing scheduling problem (2011)

    Bougeret, Marin; Dutot, Pierre-Francois; Goldman, Alfredo ; Ngoko, Yanik; Trystram, Denis

    Source: International Journal of Foundations of Computer Science. Conference titles: Workshop on Advances in Parallel and Distributed Computational Models - APDCM. Unidade: IME

    Assunto: ALGORITMOS

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

    • ABNT

      BOUGERET, Marin et al. Approximating the discrete resource sharing scheduling problem. International Journal of Foundations of Computer Science. Singapore: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1142/S0129054111008271. Acesso em: 05 dez. 2025. , 2011

    • APA

      Bougeret, M., Dutot, P. -F., Goldman, A., Ngoko, Y., & Trystram, D. (2011). Approximating the discrete resource sharing scheduling problem. International Journal of Foundations of Computer Science. Singapore: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1142/S0129054111008271

    • NLM

      Bougeret M, Dutot P-F, Goldman A, Ngoko Y, Trystram D. Approximating the discrete resource sharing scheduling problem [Internet]. International Journal of Foundations of Computer Science. 2011 ; 22( 3): 639-656.[citado 2025 dez. 05 ] Available from: https://doi.org/10.1142/S0129054111008271

    • Vancouver

      Bougeret M, Dutot P-F, Goldman A, Ngoko Y, Trystram D. Approximating the discrete resource sharing scheduling problem [Internet]. International Journal of Foundations of Computer Science. 2011 ; 22( 3): 639-656.[citado 2025 dez. 05 ] Available from: https://doi.org/10.1142/S0129054111008271

  • Artigo de periodico

    Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (2008)

    Cintra, Glauber Ferreira ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko ; Xavier, Eduardo C

    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: 05 dez. 2025.

    • 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 2025 dez. 05 ] 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 2025 dez. 05 ] Available from: https://doi.org/10.1016/j.ejor.2007.08.007
  • 1

1 - 3 (3 records)

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