Higher‐Dimensional Packing with Order Constraints

DOI10.1137/060665713MaRDI QIDQ5426891zbMATH OpenOpenAlexFDO

Authors Sándor P. Fekete, Ekkehard Köhler, 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

exact algorithmsHigher-dimensional packinghigher-dimensional schedulingmodular decompositionprecedence constraintsreconfigurable computing

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1830743
• On Multidimensional Packing Problems
• scientific article; zbMATH DE number 1305407
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• scientific article; zbMATH DE number 2119702
• New bounds for multidimensional packing
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• Approximation schemes for multidimensional packing
• Packing under convex quadratic constraints
• Packing under convex quadratic constraints

Cited in

(7)

• Queue-constrained packing: a vehicle ferry case study
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
• A hybrid algorithm for constrained order packing
• scientific article; zbMATH DE number 1830743 (Why is no real title available?)
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• Time-constrained project scheduling with adjacent resources

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

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