On the complexity of discrete bicriterion optimization using dynamic programming (1991)
- Authors:
- Autor USP: HUMES JUNIOR, CARLOS - IME
- Unidade: IME
- Assunto: PROGRAMAÇÃO DINÂMICA
- Language: Inglês
- Imprenta:
- Publisher: University of Coimbra
- Publisher place: Coimbra
- Date published: 1991
- Source:
- Título: Abstracts
- Conference titles: Workshop on Large-Scale Optimization
-
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: 25 jan. 2026. -
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 2026 jan. 25 ] -
Vancouver
Humes Júnior C, Wasserstein SL, Zanjacomo PR. On the complexity of discrete bicriterion optimization using dynamic programming. Abstracts. 1991 ;[citado 2026 jan. 25 ] - The delay of open markovian queueing networks: uniform functional bounds, heavy traffic pole multiplicities, and stability
- A projection-feasible direction method for the continuous capacity and flow assignment
- Contribution to the slow server problem analysis
- Decentralized scheduling in manufacturing systems
- Algoritmo A e sua relação com dualidade
- Politica de reserva de mercado e o fortalecimento do poder nacional
- Integracao empresa - escola: particularizando a universidade
- Some results in the perkins-kumar frame work for distributed activity scheduling
- Distributed scheduling of flexible manufacturing systems: stability and performance
- Tópico de otimização em redes de computadores
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
