GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem

DOI10.1287/ijoc.1050.0169zbMath1241.90180OpenAlexW2157238259MaRDI QIDQ2892334

Ramón Alvarez-Valdés, Antonio Parajón, José Manuel Tamarit, Rafael Martí

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1050.0169

zbMATH Keywords

heuristicscutting packingGRASP path relinking

Mathematics Subject Classification ID

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

Related Items (4)

An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems ⋮ Fast heuristic for constrained homogenous T-shape cutting patterns

This page was built for publication: GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem