Modified greedy heuristic for the one-dimensional cutting stock problem

DOI10.1007/S10878-021-00695-4MaRDI QIDQ2051915zbMATH OpenOpenAlexFDO

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

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

bin packingcolumn generationcutting patternheuristiclinear programmingoptimization

Mathematics Subject Classification ID

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

Recommendations

• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
• A new heuristic algorithm for the one-dimensional cutting stock problem
• Near-optimal solutions to one-dimensional cutting stock problems
• The one-dimensional cutting stock problem with usable leftover - a heuristic approach

Cites work

• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• A cutting stock problem and its solution in the manufacturing industry of large electric generators
• A hybrid heuristic to reduce the number of different patterns in cutting stock problems
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Linear Programming Approach to the Cutting-Stock Problem
• A one-dimensional cutting stock problem in the aluminium industry and its solution
• An LP-based approach to cutting stock problems with multiple objectives
• Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
• Core problems in knapsack algorithms
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 47262 (Why is no real title available?)
• Pattern minimisation in cutting stock problems
• Pattern reduction in one-dimensional cutting stock problems
• Solving binary cutting stock problems by column generation and branch- and-bound
• The cutting stock problem and integer rounding
• The cutting stock problem in the canvas industry
• The modified integer round-up property of the one-dimensional cutting stock problem
• The one-dimensional cutting stock problem with usable leftover - a heuristic approach
• The trim-loss and assortment problems: A survey

Cited in

(3)

• Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
• scientific article; zbMATH DE number 3970488 (Why is no real title available?)
• Mathematical models for the one-dimensional cutting stock problem with setups and open stacks

Describes a project that uses

Uses Software

• CUTGEN1
• Knapsack

This page was built for publication: Modified greedy heuristic for the one-dimensional cutting stock problem

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