Two heuristics for the continuous capacity and flow assignement global optimization (1999)
- Authors:
- USP affiliated authors: HUMES JUNIOR, CARLOS - IME ; QUEIROZ, MARCELO GOMES DE - IME
- Unidade: IME
- Assunto: PROGRAMAÇÃO MATEMÁTICA
- Language: Inglês
- Imprenta:
-
ABNT
QUEIROZ, Marcelo Gomes de e HUMES JÚNIOR, Carlos. Two heuristics for the continuous capacity and flow assignement global optimization. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/65da0570-d0ad-465e-b176-ae2f1cc11c84/1057315.pdf. Acesso em: 24 dez. 2025. , 1999 -
APA
Queiroz, M. G. de, & Humes Júnior, C. (1999). Two heuristics for the continuous capacity and flow assignement global optimization. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/65da0570-d0ad-465e-b176-ae2f1cc11c84/1057315.pdf -
NLM
Queiroz MG de, Humes Júnior C. Two heuristics for the continuous capacity and flow assignement global optimization [Internet]. 1999 ;[citado 2025 dez. 24 ] Available from: https://repositorio.usp.br/directbitstream/65da0570-d0ad-465e-b176-ae2f1cc11c84/1057315.pdf -
Vancouver
Queiroz MG de, Humes Júnior C. Two heuristics for the continuous capacity and flow assignement global optimization [Internet]. 1999 ;[citado 2025 dez. 24 ] Available from: https://repositorio.usp.br/directbitstream/65da0570-d0ad-465e-b176-ae2f1cc11c84/1057315.pdf - On finding global optima for the hinge fitting problem
- The symmetric eigenvalue complementarity problem
- The symmetric eigenvalue complementarity problem
- The projected pairwise multicommodity flow polyhedron
- A heuristic for the continuous capacity and flow assignment
- On finding global optima for the hinge fitting problem
- On the projected pairwise multicommodity flow polyhedron
- A note on stability of clearing open loop policies in manufacturing systems
- Integracao empresa - escola: particularizando a universidade
- Algoritmo A e sua relação com dualidade
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
| 1057315.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
