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