A Linear Programming Approach to the Cutting-Stock Problem

Keywords

Linear programming, Cutting stock problem, Integer programming, Computation, Mathematical optimization

References

• Programming of Economic Lot SizesAlan S. Manne — 1958
• An algorithm for integer solutions to linear programsRalph E. Gomory — 1958
• Discrete-Variable Extremum ProblemsGeorge B. Dantzig — 1957
• The Trim ProblemKurt Eisemann — 1957
• Decomposition Principle for Linear ProgramsGeorge B. Dantzig, Philip Wolfe — 1960
• A MODEL FOR THE OPTIMAL PROGRAMMING OF RAILWAY FREIGHT TRAIN MOVEMENTSA. Charnes, Merton H. Miller — 1956

Cited by

• Ambulance routing problems with rich constraints and multiple objectivesSophie N. Parragh — 2009
• Improved performance by integrated corrugator and converter schedulingJ. Kars — 2014
• Routing and Scheduling Using Column Generation in IEEE 802.16j Wireless Relay NetworksTomas M. Murillo — 2011
• Integrating dock-door assignment and vehicle routing with cross-dockingFurkan Enderer, Claudio Contardo, Ivan Contreras — 2017
• Application of the cutting stock problem to a construction company: a case studySeda Alp, Gürdal Ertek, Ş. İlker Birbil — 2006
• A fractional algorithm for optimal cutting of lumber into dimension partsCelso Carnieri, Guillermo Mendoza — 2000
• Heuristic algorithms for wireless mesh network planningShah Mostafa Khaled — 2012
• Cho-k-NN: A Method for Combining Interacting Pieces of Evidence in Case-Based LearningEyke Hüllermeier — 2005
• Nurse rescheduling with shift preferences and minimal disruptionAlistair Clark, Hannah Walker — 2011
• Column Generation in Infeasible Predictor-Corrector Methods for Solving Linear ProgramsStacey Oneeta Nicholls — 2009
• An Evaluation of Parallel Knapsack Algorithms on Multicore ArchitecturesHammad Rashid, Clara Novoa, Apan Qasem — 2010
• An efficient heuristic for robot acquisition and cell formationBernard T. Han, Jack Cook — 1998
• Models and Methods for Multiple Resource Constrained Job Scheduling under UncertaintyBrian D. Keller — 2009
• Pendekatan Program Linear untuk Persoalan Pemotongan Stok (Pola Pemotongan Satu Dimensi)Gamal Mdh, Zaiful Bahri — 2003
• An Exact Best-First Search Procedure for the Constrained Rectangular Guillotine Knapsack ProblemK. V. Viswanathan, A. Bagchi — 1988
• Mass customization in cutting stock processPeter Trkman, Miro Gradišar — 2006
• Bin packing and related problems - pattern-based approachesFilipe Brandão — 2012
• Optimization in logical analysis of dataBonates, Tiberius — 2007
• Mini Max WallpaperA. Marigonda, D. Aleksov, J. Idziak — 2013
• Pattern sequencing models in cutting stock problemsIsabel da Silva Lopes — 2011

Related papers

• A Novel Alternative Algorithm for Solving Integer Linear Programming Problems Having Three VariablesKadriye Şimşek Alan — 2020
• Non-linear integer programmingLeon N. Cooper, Mary W. Cooper — 1975
• Testing the Robustness of Linear Programming* Using a Diet Problem on a Multi-Shop SystemSampson Takyi Appiah, Bernard Atta Adjei, Dominic Otoo — 2019
• A mixed-integer programming model for a class of assortment problemsChin‐Sheng Chen, Sanjiv Sarin, Balasubramanian Ram — 1993
• Multi-criteria integer linear fractional programming problemR.K. Gupta, Raghav Malhotra — 1995
• The reformulation of two mixed integer programming problemsHugh Williams — 1978