Sensitive instances of the cutting stock problem

DOI10.1007/978-3-030-58657-7_9MaRDI QIDQ4965102zbMATH OpenOpenAlexFDO

Authors Artem V. Ripatti, V. M. Kartak

Publication date 25 February 2021

Published in Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-58657-7_9

zbMATH Keywords

cutting stock probleminteger round up propertyintegrality gapsensitive instances

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Large gaps in one-dimensional cutting stock problems
• scientific article; zbMATH DE number 827989
• Tighter relaxations for the cutting stock problem
• Families of non-IRUP instances of the one-dimensional cutting stock problem
• Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem

Cites work

• A Linear Programming Approach to the Cutting-Stock Problem
• An instance of the cutting stock problem for which the rounding property does not hold
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Families of non-IRUP instances of the one-dimensional cutting stock problem
• Integer Rounding for Polymatroid and Branching Optimization Problems
• Large gaps in one-dimensional cutting stock problems
• Large proper gaps in bin packing and dual bin packing problems
• Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
• Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
• The modified integer round-up property of the one-dimensional cutting stock problem
• Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem

Cited in

(6)

• New cases of the cutting stock problem having MIRUP
• Families of non-IRUP instances of the one-dimensional cutting stock problem
• scientific article; zbMATH DE number 5688457 (Why is no real title available?)
• scientific article; zbMATH DE number 827989 (Why is no real title available?)
• Nested \((2,3)\)-instances of the cutting stock problem
• Large gaps in one-dimensional cutting stock problems

This page was built for publication: Sensitive instances of the cutting stock problem

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