A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing

DOI10.1287/MOOR.1030.0079MaRDI QIDQ5704177zbMATH OpenOpenAlexFDO

Authors Sándor P. Fekete, Jörg Schepers

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 boundcocomparability graphscomparability graphsdiscrete structuresexact algorithmsgeometric optimizationhigher-dimensional packing and cuttinginterval graphsorthogonal structures

Mathematics Subject Classification ID

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

Recommendations

• A general framework for bounds for higher-dimensional orthogonal packing problems.
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• Packing, Tiling, Orthogonality and Completeness
• scientific article; zbMATH DE number 797898
• scientific article; zbMATH DE number 1830743
• Higher‐Dimensional Packing with Order Constraints
• Higher dimensional Apollonian packings, revisited
• On a combinatorial structure of the problems of optimal packing of geometric objects
• Packing problems, dimensions and the tensor product of complete lattices
• Combinatorial cube packings in the cube and the torus

Cited in

(46)

• 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
• On the two-dimensional knapsack problem
• A new quasi-human algorithm for solving the packing problem of unit equilateral triangles
• LP bounds in various constraint programming approaches for orthogonal packing
• Space defragmentation for packing problems
• A global optimization point of view to handle non-standard object packing problems
• Conservative scales in packing problems
• Exact solution techniques for two-dimensional cutting and packing
• The maximum diversity assortment selection problem
• A hybrid metaheuristic for the two-dimensional strip packing problem
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
• A new constraint programming approach for the orthogonal packing problem
• Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
• 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 rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
• A comparative review of 3D container loading algorithms
• Data structures for higher-dimensional rectilinear packing
• An efficient deterministic optimization approach for rectangular packing problems
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• One-dimensional relaxations and LP bounds for orthogonal packing
• The load-balanced multi-dimensional bin-packing problem
• A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM
• On the weak computability of a four dimensional orthogonal packing and time scheduling problem
• The three-dimensional knapsack problem with balancing constraints
• Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped
• Model development and optimization for space engineering: concepts, tools, applications, and perspectives
• A fast heuristic for a three-dimensional non-convex domain loading problem
• Efficient algorithms for orthogonal packing problems
• Consecutive ones matrices for multi-dimensional orthogonal packing problems
• Consecutive ones matrices for multi-dimensional orthogonal packing problems
• An introduction to the two‐dimensional rectangular cutting and packing problem
• A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority
• A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• Optimal rectangle packing
• The off-line group seat reservation problem
• A two-phase constructive algorithm for the single container mix-loading problem
• A fast optimization approach for a complex real-life 3D multiple bin size bin packing problem
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
• A new search procedure for the two-dimensional orthogonal packing problem
• Multi-dimensional bin packing problems with guillotine constraints

Describes a project that uses

Uses Software

• OR-Library

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

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