Higher‐Dimensional Packing with Order Constraints

DOI10.1137/060665713zbMath1136.90453OpenAlexW2137530332MaRDI QIDQ5426891

Ekkehard Köhler, Sándor P. Fekete, Jürgen Teich

Publication date: 16 November 2007

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060665713

zbMATH Keywords

precedence constraintsmodular decompositionexact algorithmsreconfigurable computingHigher-dimensional packinghigher-dimensional scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete mathematics in relation to computer science (68R99)

Related Items (3)

Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width ⋮ Time-constrained project scheduling with adjacent resources ⋮ Queue-constrained packing: a vehicle ferry case study

This page was built for publication: Higher‐Dimensional Packing with Order Constraints