LP models for bin packing and cutting stock problems

European Journal of Operational Research

Volumn 141, Issue 2, 2002, Pages 253-273

  Valerio De Carvalho J M ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

Bin packing; Cutting stock

Indexed keywords

ALGORITHMS; INVENTORY CONTROL; MATHEMATICAL MODELS; PROBLEM SOLVING;

BIN PACKING PROBLEMS; BRANCH AND PRICE METHOD; CUTTING STOCK PROBLEMS;

LINEAR PROGRAMMING;

EID: 0036722415     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00124-8     Document Type: Article

References (34)

1. Branch-and-price: Column generation for solving huge integer programs
2. An exact two-dimensional non-guillotine cutting tree search procedure
3. Exact solution of bin-packing problems using column generation and branch-and-bound
4. A note on branch-and-price algorithms for the one-dimensional cutting stock problem
5. A time-indexed formulation of non-preemptive single machine scheduling problems
6. A unified framework for deterministic time constrained routing and crew scheduling problems
7. A new optimization algorithm for the vehicle routing problem with time windows
8. Time constrained routing and scheduling
9. A new linear programming approach to the cutting stock problem
10. Production theoretic foundations of cutting and related processes
11. A typology of cutting and packing problems
12. Bridges between two principal model formulations for cutting stock processes
13. Lagrangian relaxation and its uses in integer programming
14. Cutting stock, linear programming, knapsacking, dynamic programming and integer programming, some interconnections
15. A linear programming approach to the cutting stock problem
16. A linear programming approach to the cutting stock problem - Part II
17. Modeling and strong linear programs for mixed integer programming
18. Mathematical methods of organising and planning production
19. Optimization theory for large systems
20. A comparison of two optimization procedures for 1- and 1 1/2-dimensional cutting stock problems
21. One-dimensional cutting stock problem in the aluminium industry and its solution
22. Bison: A fast hybrid procedure for exactly solving the one-dimensional bin-packing problem
23. A new lower bound for the bin-packing problem and its integration into MTP
24. Branch-and-price algorithms for the one-dimensional cutting stock problem
25. Solving binary cutting stock problems by column generation and branch-and-bound
26. Computational study of a column generation algorithm for binpacking and cutting stock problems
27. On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm
28. An exact algorithm for IP column generation
29. Heuristics for the integer one-dimensional cutting stock problem: A computational study