Combinatorial complexity of a certain 1-dimensional cutting stock problem

zbMATH Open1249.05049MaRDI QIDQ2900934FDOQ2900934

Authors: V. M. Kartak, V. V. Kartak 

Publication date: 26 July 2012

Published in: Ufimskiĭ Matematicheskiĭ Zhurnal (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/ufa/v3/i4/p57

Recommendations

• scientific article; zbMATH DE number 1803213
• scientific article; zbMATH DE number 444980
• A combined approach to the solution to the general one-dimensional cutting stock problem
• scientific article; zbMATH DE number 2044946
• A note on the approximability of cutting stock problems
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
• scientific article; zbMATH DE number 2068615
• On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs
• Combinatorial properties and the complexity of a max-cut approximation
• One-dimensional cutting stock problem to minimize the number of different patterns

zbMATH Keywords

integer programmingcutting stock problemcombinatorial complexitymethod of branches and boundaries

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Cited In (2)

• A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths
• Title not available (Why is that?)

This page was built for publication: Combinatorial complexity of a certain 1-dimensional cutting stock problem

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