Pattern minimisation in cutting stock problems
Author:
- Colin McDiarmidCMColin McDiarmid
- 1 October 1999
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 98 (1-2) , 121-130
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and KarpMathematics of Operations Research, 1996
- The modified differencing method for the set partitioning problem with cardinality constraintsDiscrete Applied Mathematics, 1995
- Cutting and Packing Problems: A Categorized, Application-Orientated Research BibliographyJournal of the Operational Research Society, 1992
- Simple Constructions of Almost k‐wise Independent Random VariablesRandom Structures & Algorithms, 1992
- Optimal solutions for the cutting stock problemEuropean Journal of Operational Research, 1990
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- On the cryptocomplexity of knapsack systems1979
- A Linear Programming Approach to the Cutting Stock Problem—Part IIOperations Research, 1963
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961