An instance of the cutting stock problem for which the rounding property does not hold
From MaRDI portal
Publication:1080366
DOI10.1016/0167-6377(86)90009-XzbMath0598.90066OpenAlexW2014510366MaRDI QIDQ1080366
Publication date: 1986
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(86)90009-x
Related Items
Families of non-IRUP instances of the one-dimensional cutting stock problem, Solving binary cutting stock problems by column generation and branch- and-bound, Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem, Bin packing and cutting stock problems: mathematical models and exact algorithms, Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem, Heuristics for the integer one-dimensional cutting stock problem: A computational study, A branch-and-price algorithm for capacitated hypergraph vertex separation, Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property, The modified integer round-up property of the one-dimensional cutting stock problem, Large proper gaps in bin packing and dual bin packing problems, Nested \((2,3)\)-instances of the cutting stock problem, Large gaps in one-dimensional cutting stock problems, The proper relaxation and the proper gap of the skiving stock problem, Knowledge based approach to the cutting stock problem, Carathéodory bounds for integer cones, The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP, An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case, Analysis of upper bounds for the pallet loading problem, A rounding theorem for unique binary tomographic reconstruction, Sensitive Instances of the Cutting Stock Problem, Tighter relaxations for the cutting stock problem, A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems, A one-dimensional cutting stock problem in the aluminium industry and its solution, Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound, A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths, Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths, A branch-and-price algorithm for the temporal bin packing problem, Friendly bin packing instances without integer round-up property, Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
Cites Work
