Menu

Filtros : "PROGRAMAÇÃO DINÂMICA" "1991" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Trabalho de evento-resumo

    On the complexity of discrete bicriterion optimization using dynamic programming (1991)

    Humes Júnior, Carlos; Wasserstein, S L; Zanjacomo, P R

    Source: Abstracts. Conference titles: Workshop on Large-Scale Optimization. Unidade: IME

    Assunto: PROGRAMAÇÃO DINÂMICA

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

    • ABNT

      HUMES JÚNIOR, Carlos e WASSERSTEIN, S L e ZANJACOMO, P R. On the complexity of discrete bicriterion optimization using dynamic programming. 1991, Anais.. Coimbra: University of Coimbra, 1991. . Acesso em: 08 nov. 2025.

    • APA

      Humes Júnior, C., Wasserstein, S. L., & Zanjacomo, P. R. (1991). On the complexity of discrete bicriterion optimization using dynamic programming. In Abstracts. Coimbra: University of Coimbra.

    • NLM

      Humes Júnior C, Wasserstein SL, Zanjacomo PR. On the complexity of discrete bicriterion optimization using dynamic programming. Abstracts. 1991 ;[citado 2025 nov. 08 ]

    • Vancouver

      Humes Júnior C, Wasserstein SL, Zanjacomo PR. On the complexity of discrete bicriterion optimization using dynamic programming. Abstracts. 1991 ;[citado 2025 nov. 08 ]

  • Relatorio tecnico

    Complexity-oriented analysis of programming implementation: bicriterion case (1991)

    Humes Júnior, Carlos; Wasserstein, Sergio Luis; Zanjacomo, Paulo Regis

    Unidade: IME

    Assunto: PROGRAMAÇÃO DINÂMICA

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

    • ABNT

      HUMES JÚNIOR, Carlos e WASSERSTEIN, Sergio Luis e ZANJACOMO, Paulo Regis. Complexity-oriented analysis of programming implementation: bicriterion case. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/db5275f5-63ad-426d-8c6e-42563defadf0/813018.pdf. Acesso em: 08 nov. 2025. , 1991

    • APA

      Humes Júnior, C., Wasserstein, S. L., & Zanjacomo, P. R. (1991). Complexity-oriented analysis of programming implementation: bicriterion case. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/db5275f5-63ad-426d-8c6e-42563defadf0/813018.pdf

    • NLM

      Humes Júnior C, Wasserstein SL, Zanjacomo PR. Complexity-oriented analysis of programming implementation: bicriterion case [Internet]. 1991 ;[citado 2025 nov. 08 ] Available from: https://repositorio.usp.br/directbitstream/db5275f5-63ad-426d-8c6e-42563defadf0/813018.pdf

    • Vancouver

      Humes Júnior C, Wasserstein SL, Zanjacomo PR. Complexity-oriented analysis of programming implementation: bicriterion case [Internet]. 1991 ;[citado 2025 nov. 08 ] Available from: https://repositorio.usp.br/directbitstream/db5275f5-63ad-426d-8c6e-42563defadf0/813018.pdf
  • 1

1 - 2 (2 records)

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