A hybrid algorithm for the one-dimensional cutting stock problem (2000)
- Authors:
- USP affiliated authors: WAKABAYASHI, YOSHIKO - IME ; CINTRA, GLAUBER FERREIRA - IME
- Unidade: IME
- Assunto: ALGORITMOS GENÉTICOS
- Language: Inglês
- Imprenta:
- Publisher: Georgia Institute of Technology
- Publisher place: Atlanta, GA
- Date published: 2000
- Source:
- Título: Abstracts
- Conference titles: International Symposium on Mathematical Programming
-
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: 05 jun. 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 jun. 05 ] -
Vancouver
Wakabayashi Y, Cintra GF. A hybrid algorithm for the one-dimensional cutting stock problem. Abstracts. 2000 ;[citado 2025 jun. 05 ] - Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems
- Algoritmos híbridos para problemas de corte unidimensional
- Algoritmos para problemas de corte de guilhotina bidimensional
- Um algoritmo híbrido para o problema de corte unidimensional
- Contribuições a teoria dos grafos e otimização combinatória
- Two-and three-dimensional parametric packing
- Composition of facets of the clique partitioning polytope
- On the circuit cover problem for mixed graphs
- Near-optimum universal graphs for graphs with bounded degrees
- The maximum agreement forest problem: approximation algorithms and computational experiments
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
