An instance of the cutting stock problem for which the rounding property does not hold

DOI10.1016/0167-6377(86)90009-XzbMATH Open0598.90066OpenAlexW2014510366MaRDI QIDQ1080366FDOQ1080366

Authors: Odile Marcotte 

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

Recommendations

• Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property
• The cutting stock problem and integer rounding
• Sufficient conditions for the integer round-up property to be violated for the linear cutting stock problem
• The modified integer round-up property of the one-dimensional cutting stock problem
• New cases of the cutting stock problem having MIRUP

zbMATH Keywords

NP-hardcutting stockinteger rounding property

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Production models (90B30)

Cites Work

• Title not available (Why is that?)
• Integer Rounding for Polymatroid and Branching Optimization Problems
• The cutting stock problem and integer rounding

Cited In (32)

• Sufficient conditions for the integer round-up property to be violated for the linear cutting stock problem
• A rounding theorem for unique binary tomographic reconstruction
• Families of non-IRUP instances of the one-dimensional cutting stock problem
• Large proper gaps in bin packing and dual bin packing problems
• A rounding algorithm for integer programs
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
• The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
• Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
• Carathéodory bounds for integer cones
• A branch-and-price algorithm for capacitated hypergraph vertex separation
• Analysis of upper bounds for the pallet loading problem
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
• The modified integer round-up property of the one-dimensional cutting stock problem
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Sensitive instances of the cutting stock problem
• A one-dimensional cutting stock problem in the aluminium industry and its solution
• Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
• Large gaps in one-dimensional cutting stock problems
• Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem
• Solving binary cutting stock problems by column generation and branch- and-bound
• Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
• Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property
• Knowledge based approach to the cutting stock problem
• Title not available (Why is that?)
• Tighter relaxations for the cutting stock problem
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• The proper relaxation and the proper gap of the skiving stock problem
• Nested \((2,3)\)-instances of the cutting stock problem
• 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

This page was built for publication: An instance of the cutting stock problem for which the rounding property does not hold

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1080366)