A Heuristic Solution of the Rectangular Cutting Stock Problem.
Antonio AlbanoRenzo OrsiniPublished in: Comput. J. (1980)
Keyphrases
- heuristic solution
- multi commodity
- column generation
- knapsack problem
- network design problem
- network design
- branch and bound
- integer programming
- lower bound
- optimal solution
- exhaustive search
- feasible solution
- mixed integer programming
- integer program
- branch and bound algorithm
- dynamic programming
- scheduling problem
- valid inequalities
- np hard
- artificial neural networks