<--- Back to Details
First PageDocument Content
Theoretical computer science / Operations research / Mathematical optimization / Combinatorial optimization / Discrete geometry / Bin packing problem / Packing problem / Genetic algorithm / Cutting stock problem / Mathematics / Applied mathematics / Packaging
Theoretical computer science
Operations research
Mathematical optimization
Combinatorial optimization
Discrete geometry
Bin packing problem
Packing problem
Genetic algorithm
Cutting stock problem
Mathematics
Applied mathematics
Packaging

Int. J. Production Economics ∎ (∎∎∎∎) ∎∎∎–∎∎∎ Contents lists available at SciVerse ScienceDirect Int. J. Production Economics journal homepage: www.elsevier.com/locate/ijpe

Add to Reading List

Source URL: isiarticles.com

Download Document from Source Website

File Size: 406,79 KB

Share Document on Facebook

Similar Documents

COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used

COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used

DocID: 1r5tA - View Document

65  Documenta Math. Column Generation for Linear and Integer Programming George L. Nemhauser

65 Documenta Math. Column Generation for Linear and Integer Programming George L. Nemhauser

DocID: 1qtoW - View Document

65  Documenta Math. Column Generation for Linear and Integer Programming George L. Nemhauser

65 Documenta Math. Column Generation for Linear and Integer Programming George L. Nemhauser

DocID: 1oBMa - View Document

1 Column Generation and the Cutting Stock Problem In the linear programming approach to the traveling salesman problem we used the cutting plane approach. The cutting plane approach is appropriate when the number of vari

1 Column Generation and the Cutting Stock Problem In the linear programming approach to the traveling salesman problem we used the cutting plane approach. The cutting plane approach is appropriate when the number of vari

DocID: 1lFdZ - View Document

Int. J. Production Economics ∎ (∎∎∎∎) ∎∎∎–∎∎∎  Contents lists available at SciVerse ScienceDirect Int. J. Production Economics journal homepage: www.elsevier.com/locate/ijpe

Int. J. Production Economics ∎ (∎∎∎∎) ∎∎∎–∎∎∎ Contents lists available at SciVerse ScienceDirect Int. J. Production Economics journal homepage: www.elsevier.com/locate/ijpe

DocID: 18Lbt - View Document