A heuristic for the problem of one-dimensional steel coil cutting

DOI10.1007/s40314-021-01421-wzbMath1476.90005MaRDI QIDQ1983859

M. H. Pimenta-Zanon, F. Sakuray, Robinson Hoto

Publication date: 10 September 2021

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-021-01421-w

zbMATH Keywords

heuristic; compartmentalized knapsack problem; cutting steel coils; discrete linear optimization

Mathematics Subject Classification ID

90C10: Integer programming

90C05: Linear programming

90C59: Approximation methods and heuristics in mathematical programming

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• The constrained compartmentalised knapsack problem
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
• Class constrained bin packing revisited
• An LP-based approach to a two-stage cutting stock problem
• Row and column generation technique for a multistage cutting stock problem
• VNS matheuristic for a bin packing problem with a color constraint
• A two-phase roll cutting problem
• Computational aspects of hard knapsack problems.
• A minimal algorithm for the Bounded Knapsack Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions
• Discrete-Variable Extremum Problems
• A strong integer linear optimization model to the compartmentalized knapsack problem
• An integer linear optimization model to the compartmentalized knapsack problem