A combined approach to the solution to the general one-dimensional cutting stock problem

DOI10.1016/j.cor.2003.11.028zbMath1074.90045OpenAlexW2008564682MaRDI QIDQ1777156

Peter Trkman, Miro Gradisar

Publication date: 12 May 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.11.028

zbMATH Keywords

HeuristicsOptimizationBranch-and-boundCutting

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (11)

An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ One-dimensional cutting stock optimization in consecutive time periods ⋮ A heuristic for the one-dimensional cutting stock problem with usable leftover ⋮ Reducing the number of cuts in generating three-staged cutting patterns ⋮ A note on ``Reducing the number of binary variables in cutting stock problems ⋮ The generalized assortment and best cutting stock length problems ⋮ Renovation of the cutting stock process ⋮ Optimization of a line-cutting procedure for ship hull construction by an effective tabu search ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover ⋮ The one-dimensional cutting stock problem with usable leftover - a heuristic approach ⋮ The one-dimensional cutting stock problem with usable leftovers -- a survey

Uses Software

• CUTGEN1

Cites Work

• Unnamed Item
• A sequential heuristic procedure for one-dimensional cutting
• Cutting and packing. Special issue
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
• An algorithm for the determination of optimal cutting patterns
• Optimization of roll cutting in clothing industry
• Exact algorithms for the guillotine strip cutting/packing problem.
• Row and column generation technique for a multistage cutting stock problem
• Evaluation of algorithms for one-dimensional cutting
• A typology of cutting and packing problems
• An LP-based approach to cutting stock problems with multiple objectives
• LP models for bin packing and cutting stock problems
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
• A 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 combined approach to the solution to the general one-dimensional cutting stock problem