Modified greedy heuristic for the one-dimensional cutting stock problem

DOI10.1007/s10878-021-00695-4zbMath1481.90271OpenAlexW3130904396MaRDI QIDQ2051915

Gonçalo R. L. Cerqueira, Marlos Marques, Sérgio S. Aguiar

Publication date: 25 November 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00695-4

zbMATH Keywords

optimizationlinear programmingcolumn generationheuristicbin packingcutting pattern

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost

Uses Software

• Knapsack
• CUTGEN1

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
• The one-dimensional cutting stock problem with usable leftover - a heuristic approach
• The modified integer round-up property of the one-dimensional cutting stock problem
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
• The trim-loss and assortment problems: A survey
• Solving binary cutting stock problems by column generation and branch- and-bound
• A cutting stock problem and its solution in the manufacturing industry of large electric generators
• A one-dimensional cutting stock problem in the aluminium industry and its solution
• The cutting stock problem in the canvas industry
• An LP-based approach to cutting stock problems with multiple objectives
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• Pattern minimisation in cutting stock problems
• A hybrid heuristic to reduce the number of different patterns in cutting stock problems
• Core Problems in Knapsack Algorithms
• A Linear Programming Approach to the Cutting-Stock Problem
• The cutting stock problem and integer rounding
• Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
• Pattern reduction in one-dimensional cutting stock problems
• A Linear Programming Approach to the Cutting Stock Problem—Part II