Solving binary cutting stock problems by column generation and branch-and-bound.
Pamela H. VanceCynthia BarnhartEllis L. JohnsonGeorge L. NemhauserPublished in: Comput. Optim. Appl. (1994)
Keyphrases
- column generation
- branch and bound
- integer program
- combinatorial optimization
- linear programming problems
- set partitioning
- exact solution
- cutting stock problems
- lower bound
- search algorithm
- branch and bound algorithm
- optimal solution
- search space
- branch and bound search
- upper bound
- mixed integer programming
- cutting plane
- linear programming relaxation
- beam search
- vehicle routing problem with time windows
- lagrangian relaxation
- tree search
- traveling salesman problem
- simulated annealing
- max sat
- search strategies
- bnb adopt
- integer programming
- metaheuristic
- cost function
- multiple objectives
- optimization problems
- multi objective
- constraint programming
- neural network