Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm.
Guntram ScheithauerJohannes TernoAntje MüllerGleb BelovPublished in: J. Oper. Res. Soc. (2001)
Keyphrases
- multiple objectives
- cutting stock problems
- cutting plane algorithm
- cutting plane
- integer programming
- maximum margin
- max flow
- linear programming
- valid inequalities
- combinatorial optimization
- quadratic programming
- vehicle routing problem with time windows
- genetic algorithm
- maximum likelihood
- linear program
- integer program