An incremental linear-time algorithm for recognizing interval graphs
SIAM Journal on Computing
Optimal FPGA module placement with temporal precedence constraints
Proceedings of the conference on Design, automation and test in Europe
Optimization of Dynamic Hardware Reconfigurations
The Journal of Supercomputing
New Classes of Lower Bounds for Bin Packing Problems
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Processor Allocation in k-ary n-cube Multiprocessors
ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis
Operations Research Letters
International Journal of Applied Evolutionary Computation
| Hi-index | 0.00 |
We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture and can be interpreted as higher-dimensional generalizations of scheduling problems. Using graph-theoretic structures to describe feasible solutions, we develop a novel exact branch-and-bound algorithm. This extends previous work by Fekete and Schepers; a key tool is a new order-theoretic characterization of feasible extensions of a partial order to a given comparability graph that is tailor-made for use in a branch-and-bound environment. The usefulness of our approach is validated by computational results.