A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands

DOI10.1111/itor.13122OpenAlexW4210885149MaRDI QIDQ6060670

Unnamed Author, Marina Andretta

Publication date: 29 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13122

zbMATH Keywords

stochastic programmingvariable neighborhood searchirregular strip packing problemuncertain demands

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows

Cites Work

• Unnamed Item
• Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic
• Robust mixed-integer linear programming models for the irregular strip packing problem
• Algorithms for nesting with defects
• Generalized hyper-heuristics for solving 2D regular and irregular packing problems
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• Variable neighbourhood search: methods and applications
• Robust supply chain design under uncertain demand in agile manufacturing
• On genetic algorithms for the packing of polygons
• TOPOS -- A new constructive algorithm for nesting problems
• A clique covering MIP model for the irregular strip packing problem
• Matheuristics for the irregular bin packing problem with free rotations
• A beam search approach to solve the convex irregular bin packing problem with guillotine guts
• A 2-exchange heuristic for nesting problems
• Grids for cutting and packing problems: a study in the 2D knapsack problem
• Mixed-integer programming models for nesting problems
• Irregular packing problems: a review of mathematical models
• A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
• The geometry of nesting problems: a tutorial
• An improved typology of cutting and packing problems
• Introduction to Stochastic Programming
• Solving nesting problems with non-convex polygons by constraint logic programming
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands