A Heuristic Solution of a Cutting Problem Using Hypergraphs

DOI10.1007/978-3-642-36899-8_33MaRDI QIDQ4915264zbMATH OpenOpenAlexFDO

Authors 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

cutting problemGilmore and Gomory approachone-dimensional

Mathematics Subject Classification ID

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

Recommendations

• Algorithms for the determination of cutsets in a hypergraph
• Computing minimum cuts in hypergraphs
• Heuristic and exact methods for the cutting sequencing problem
• Computing minimum multiway cuts in hypergraphs
• Randomized heuristics for the Max-Cut problem
• A multiple search operator heuristic for the max-k-cut problem
• A gradient-based randomised heuristic for the maximum cut problem
• Sketching cuts in graphs and hypergraphs
• scientific article; zbMATH DE number 1670644

Cites work

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

Cited in

(2)

• Heuristic and exact methods for the cutting sequencing problem
• Algorithms for the determination of cutsets in a hypergraph

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

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