LP bounds in an interval-graph algorithm for orthogonal-packing feasibility
From MaRDI portal
Publication:5301142
DOI10.1287/OPRE.1120.1150zbMATH Open1267.90118OpenAlexW1964951253MaRDI QIDQ5301142FDOQ5301142
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
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)
- Exact solution techniques for two-dimensional cutting and packing
- The value of integrating loading and routing
- Olp: An R package for optimal linear partitions of finite sets of points on the plane
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
- Consecutive ones matrices for multi-dimensional orthogonal packing problems
- One-dimensional relaxations and LP bounds for orthogonal packing
- 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
- LP bounds in various constraint programming approaches for orthogonal packing
- Combinatorial Benders' cuts for the strip packing problem
- MPQ-trees for the orthogonal packing problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- A branch-and-price algorithm for the temporal bin 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)
