Sensitive Instances of the Cutting Stock Problem

DOI10.1007/978-3-030-58657-7_9zbMath1460.90157OpenAlexW3084928241MaRDI QIDQ4965102

Artem V. Ripatti, Vadim 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 problemintegrality gapinteger round up propertysensitive instances

Mathematics Subject Classification ID

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

Related Items (1)

Nested \((2,3)\)-instances of the cutting stock problem

Cites Work

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

This page was built for publication: Sensitive Instances of the Cutting Stock Problem