A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size

DOI10.1016/j.ejor.2011.10.018zbMath1244.90191OpenAlexW2015368683WikidataQ57659073 ScholiaQ57659073MaRDI QIDQ439486

Alfredo Persiani, Rosa Medina Durán, Fabio Furini, Enrico Malaguti, Paolo Toth

Publication date: 16 August 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.10.018

zbMATH Keywords

column generationcombinatorial optimizationpackingcutting

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Models for the two-dimensional two-stage cutting stock problem with multiple stock size, An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem, The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview, An introduction to the two‐dimensional rectangular cutting and packing problem, Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization, Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry, Two extended formulations for the virtual network function placement and routing problem, Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem, Lower bounds for three-dimensional multiple-bin-size bin packing problems, Vehicle scheduling problem with loss in bus ridership, Exact solution techniques for two-dimensional cutting and packing, Formulations for a problem of petroleum transportation, Two-stage two-dimensional guillotine cutting stock problems with usable leftover, Determining the best shipper sizes for sending products to customers, Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers, Strip based compact formulation for two-dimensional guillotine cutting problems

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
• The vertex coloring problem and its generalizations
• The solution of two-stage guillotine cutting stock problems having extremely varying order demands
• Integer linear programming models for 2-staged two-dimensional knapsack problems
• Two-dimensional packing problems: a survey
• A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
• Decomposition and reformulation of integer linear programming problems. (Summary)
• An improved typology of cutting and packing problems
• A Linear Programming Approach to the Cutting-Stock Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions