A branch-and-price algorithm for the two-dimensional level strip packing problem

DOI10.1007/S10288-007-0051-7MaRDI QIDQ1029564zbMATH OpenOpenAlexFDO

Authors Andrea Bettinelli, Alberto Ceselli, Giovanni Righini

Publication date 13 July 2009

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10288-007-0051-7

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• A branch and bound algorithm for the strip packing problem
• An exact algorithm for the two-dimensional strip-packing problem
• Two-dimensional packing problems: a survey
• Models and bounds for two-dimensional level packing problems
• An exact approach to the strip-packing problem

Cites work

• A branch-and-price algorithm for the two-dimensional level strip packing problem
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• A Minimal Algorithm for the 0-1 Knapsack Problem
• A near-optimal solution to a two-dimensional cutting stock problem
• An exact approach to the strip-packing problem
• An optimization algorithm for a penalized knapsack problem
• Column Generation
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1175962 (Why is no real title available?)
• Models and bounds for two-dimensional level packing problems
• Recent advances on two-dimensional bin packing problems
• Two exact algorithms for the capacitated p-median problem
• Two-Dimensional Finite Bin-Packing Algorithms
• Two-dimensional packing problems: a survey

Cited in

(12)

• A branch-and-price algorithm for the two-dimensional level strip packing problem
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
• Models and bounds for two-dimensional level packing problems
• Orientational variable-length strip covering problem: a branch-and-price-based algorithm
• Exact solution techniques for two-dimensional cutting and packing
• Triple-solution approach for the strip packing problem with two-staged patterns
• An optimization algorithm for a penalized knapsack problem
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
• A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
• Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
• Packing squares independently
• Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: A branch-and-price algorithm for the two-dimensional level strip packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029564)