A Heuristic Solution of a Cutting Problem Using Hypergraphs

DOI10.1007/978-3-642-36899-8_33zbMath1309.90042OpenAlexW90909061MaRDI QIDQ4915264

Christian Wischmann, Christian Deppe

Publication date: 9 April 2013

Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36899-8_33

zbMATH Keywords

one-dimensionalcutting problemGilmore and Gomory approach

Mathematics Subject Classification ID

Integer programming (90C10) Hypergraphs (05C65) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Geometric algorithms and combinatorial optimization.
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• The Trim Problem
• A Linear Programming Approach to the Cutting-Stock Problem
• A New Linear Programming Approach to the Cutting Stock Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II

This page was built for publication: A Heuristic Solution of a Cutting Problem Using Hypergraphs