A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing

Authors:
Sándor P. Fekete;Jörg Schepers
Affiliations:
-;-
Venue:
Mathematics of Operations Research
Year:
2004

Citing 0
Cited 22

A Set-Covering-Based Heuristic Approach for Bin-Packing Problems

INFORMS Journal on Computing
Improving utilization of reconfigurable resources using two dimensional compaction

Proceedings of the conference on Design, automation and test in Europe
A new constraint programming approach for the orthogonal packing problem

Computers and Operations Research
Improving utilization of reconfigurable resources using two-dimensional compaction

The Journal of Supercomputing
Offline and online aspects of defragmenting the module layout of a partially reconfigurable device

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Characterizing minimal interval completions towards better understanding of profile and pathwidth

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Multi-dimensional bin packing problems with guillotine constraints

Computers and Operations Research
A new graph-theoretical model for k-dimensional guillotine-cutting problems

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem

Computers and Operations Research
A hyper-heuristic approach to strip packing problems

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem

Journal of Combinatorial Optimization
Biased random-key genetic algorithms for combinatorial optimization

Journal of Heuristics
LP bounds in various constraint programming approaches for orthogonal packing

Computers and Operations Research
Bidimensional packing by bilinear programming

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Floor plan design using block algebra and constraint satisfaction

Advanced Engineering Informatics
Consecutive Ones Matrices for Multi-dimensional Orthogonal Packing Problems

Journal of Mathematical Modelling and Algorithms
The six elements to block-building approaches for the single container loading problem

Applied Intelligence
A Novel Puzzle Based Compaction (PBC) Strategy for Enhancing the Utilization of Reconfigurable Resources

International Journal of Applied Evolutionary Computation
Conservative scales in packing problems

OR Spectrum
A New Graph-Theoretical Model for the Guillotine-Cutting Problem

INFORMS Journal on Computing
Hybrid approach for 2d strip packing problem using genetic algorithm

IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advances in computational intelligence - Volume Part I
On the weak computability of a four dimensional orthogonal packing and time scheduling problem

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for instance in two- or higher-dimensional space. We present a new approach for modeling packings, using a graph-theoretical characterization of feasible packings. Our characterization allows it to deal with classes of packings that share a certain combinatorial structure, instead of having to consider one packing at a time. In addition, we can make use of elegant algorithmic properties of certain classes of graphs. This allows our characterization to be the basis for a successful branch-and-bound framework.This is the first in a series of papers describing new approaches to higher-dimensional packing.