LP bounds in an interval-graph algorithm for orthogonal-packing feasibility

DOI10.1287/OPRE.1120.1150MaRDI QIDQ5301142zbMATH OpenOpenAlexFDO

Authors Gleb Belov, Heide Rohling

Publication date 2 July 2013

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.1120.1150

zbMATH Keywords

branch-and-pricedimension reductioninterval graphpacking

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• One-dimensional relaxations and LP bounds for orthogonal packing
• LP bounds in various constraint programming approaches for orthogonal packing
• MPQ-trees for orthogonal packing problem
• scientific article; zbMATH DE number 1183280
• Consecutive ones matrices for multi-dimensional orthogonal packing problems

Cited in

(13)

• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
• An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
• The value of integrating loading and routing
• LP bounds in various constraint programming approaches for orthogonal packing
• MPQ-trees for the orthogonal packing problem
• Exact solution techniques for two-dimensional cutting and packing
• A branch-and-price algorithm for the temporal bin packing problem
• Combinatorial Benders' cuts for the strip packing problem
• One-dimensional relaxations and LP bounds for orthogonal packing
• Olp: An R package for optimal linear partitions of finite sets of points on the plane
• The Meet-in-the-Middle Principle for Cutting and Packing Problems
• Consecutive ones matrices for multi-dimensional orthogonal packing problems
• The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem

This page was built for publication: LP bounds in an interval-graph algorithm for orthogonal-packing feasibility

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