An analytical approach for column generation for one-dimensional cutting stock problem.
Jaya ThomasNarendra S. ChaudhariPublished in: CUBE (2012)
Keyphrases
- column generation
- branch and bound
- linear program
- linear programming
- integer linear programming
- integer programming
- mixed integer programming
- constraint programming
- vehicle routing
- optimal solution
- integer program
- set partitioning
- lagrangian relaxation
- set covering
- cutting plane
- lagrangean relaxation
- exact solution
- linear programming problems
- trust region
- lower bound
- linear programming relaxation
- simplex method
- sensitivity analysis
- cost function
- neural network
- cutting plane algorithm
- dantzig wolfe decomposition