Solving the one-dimensional cutting stock problem under discrete, uncertain, time-varying demands using a hybrid of special-purpose Benders' decomposition and column generation.
Aphisak WitthayapraphakornSasarose JaijitPeerayuth CharnsethikulPublished in: Int. J. Math. Oper. Res. (2021)
Keyphrases
- special purpose
- column generation
- benders decomposition
- exact solution
- integer program
- network design problem
- exact algorithms
- general purpose
- lp relaxation
- branch and bound
- linear programming
- mixed integer programming
- linear program
- nonlinear programming
- set partitioning
- mixed integer
- integer programming
- lagrangian relaxation
- optimal solution
- cutting plane
- valid inequalities
- combinatorial optimization
- search algorithm
- constraint programming
- finite number
- continuous variables
- search space
- objective function
- approximation algorithms
- linear constraints
- branch and bound algorithm
- feasible solution
- simulated annealing
- np hard
- lower bound