A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing

DOI10.1287/moor.1030.0079zbMath1082.90095OpenAlexW2055399191MaRDI QIDQ5704177

Publication date: 11 November 2005

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1030.0079

zbMATH Keywords

branch and bound cocomparability graphs interval graphs geometric optimization comparability graphs exact algorithms discrete structures orthogonal structures higher-dimensional packing and cutting

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (40)

TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem ⋮ PackLib\(^{2}\): an integrated library of multi-dimensional packing problems ⋮ A hybrid genetic algorithm for the two-dimensional single large object placement problem ⋮ A new exact method for the two-dimensional orthogonal packing problem ⋮ The load-balanced multi-dimensional bin-packing problem ⋮ A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ Space defragmentation for packing problems ⋮ A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing ⋮ Optimal rectangle packing ⋮ On the weak computability of a four dimensional orthogonal packing and time scheduling problem ⋮ The off-line group seat reservation problem ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM ⋮ A new search procedure for the two-dimensional orthogonal packing problem ⋮ A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority ⋮ A global optimization point of view to handle non-standard object packing problems ⋮ Conservative scales in packing problems ⋮ The three-dimensional knapsack problem with balancing constraints ⋮ A new quasi-human algorithm for solving the packing problem of unit equilateral triangles ⋮ On the two-dimensional knapsack problem ⋮ A new constraint programming approach for the orthogonal packing problem ⋮ Efficient algorithms for orthogonal packing problems ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ A fast heuristic for a three-dimensional non-convex domain loading problem ⋮ Consecutive ones matrices for multi-dimensional orthogonal packing problems ⋮ Multi-dimensional bin packing problems with guillotine constraints ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem ⋮ Consecutive ones matrices for multi-dimensional orthogonal packing problems ⋮ A comparative review of 3D container loading algorithms ⋮ The maximum diversity assortment selection problem ⋮ Bidimensional packing by bilinear programming ⋮ MIP-based heuristic for non-standard 3D-packing problems ⋮ A branch-and-price algorithm for the two-dimensional level strip packing problem ⋮ One-dimensional relaxations and LP bounds for orthogonal packing ⋮ A hybrid metaheuristic for the two-dimensional strip packing problem ⋮ Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems ⋮ An efficient deterministic optimization approach for rectangular packing problems ⋮ Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives

Uses Software

OR-Library

This page was built for publication: A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing