Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
From MaRDI portal
Publication:5189096
DOI10.1590/S0101-74382000000200002zbMath1181.90232MaRDI QIDQ5189096
E. A. Mukhacheva, V. M. Kartack, G. N. Belov, A. S. Mukhacheva
Publication date: 6 March 2010
Published in: Pesquisa Operacional (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ Solving robust bin-packing problems with a branch-and-price approach ⋮ L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing ⋮ A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
Cites Work
- Unnamed Item
- The modified integer round-up property of the one-dimensional cutting stock problem
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- A typology of cutting and packing problems
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
This page was built for publication: Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
