ReP USP - Resultado da busca

Trabalho de evento-resumo
A hybrid algorithm for the one-dimensional cutting stock problem (2000)
Wakabayashi, Yoshiko ; Cintra, Glauber Ferreira
Fonte: Abstracts. Nome do evento: International Symposium on Mathematical Programming. Unidade: IME
Assunto: ALGORITMOS GENÉTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
WAKABAYASHI, Yoshiko e CINTRA, Glauber Ferreira. A hybrid algorithm for the one-dimensional cutting stock problem. 2000, Anais.. Atlanta, GA: Georgia Institute of Technology, 2000. . Acesso em: 07 nov. 2025.
APA
Wakabayashi, Y., & Cintra, G. F. (2000). A hybrid algorithm for the one-dimensional cutting stock problem. In Abstracts. Atlanta, GA: Georgia Institute of Technology.
NLM
Wakabayashi Y, Cintra GF. A hybrid algorithm for the one-dimensional cutting stock problem. Abstracts. 2000 ;[citado 2025 nov. 07 ]
Vancouver
Wakabayashi Y, Cintra GF. A hybrid algorithm for the one-dimensional cutting stock problem. Abstracts. 2000 ;[citado 2025 nov. 07 ]
Trabalho de evento-resumo
A polyhedral approach for DNA fragments rearrangement (1997)
Ferreira, Carlos Eduardo ; Souza, Cid Carvalho de; Wakabayashi, Yoshiko
Fonte: Programm and Abstracts. Nome do evento: International Symposium on Mathematical Programming. Unidade: IME
Assunto: COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Carlos Eduardo e SOUZA, Cid Carvalho de e WAKABAYASHI, Yoshiko. A polyhedral approach for DNA fragments rearrangement. 1997, Anais.. Lausanne: EPFL, 1997. . Acesso em: 07 nov. 2025.
APA
Ferreira, C. E., Souza, C. C. de, & Wakabayashi, Y. (1997). A polyhedral approach for DNA fragments rearrangement. In Programm and Abstracts. Lausanne: EPFL.
NLM
Ferreira CE, Souza CC de, Wakabayashi Y. A polyhedral approach for DNA fragments rearrangement. Programm and Abstracts. 1997 ;[citado 2025 nov. 07 ]
Vancouver
Ferreira CE, Souza CC de, Wakabayashi Y. A polyhedral approach for DNA fragments rearrangement. Programm and Abstracts. 1997 ;[citado 2025 nov. 07 ]
Trabalho de evento-resumo
A projection-feasible direction method for the continuous capacity and flow assignment (1991)
Humes Júnior, Carlos
Fonte: History of mathematical programming: a collection of personal reminiscences. Nome do evento: International Symposium on Mathematical Programming. Unidade: IME
Assunto: PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HUMES JÚNIOR, Carlos. A projection-feasible direction method for the continuous capacity and flow assignment. 1991, Anais.. Amsterdam: Cwi, 1991. . Acesso em: 07 nov. 2025.
APA
Humes Júnior, C. (1991). A projection-feasible direction method for the continuous capacity and flow assignment. In History of mathematical programming: a collection of personal reminiscences. Amsterdam: Cwi.
NLM
Humes Júnior C. A projection-feasible direction method for the continuous capacity and flow assignment. History of mathematical programming: a collection of personal reminiscences. 1991 ;[citado 2025 nov. 07 ]
Vancouver
Humes Júnior C. A projection-feasible direction method for the continuous capacity and flow assignment. History of mathematical programming: a collection of personal reminiscences. 1991 ;[citado 2025 nov. 07 ]

Unidades USP

ReP

Filtros