✦ LIBER ✦

Cardinality constrained bin‐packing problems

✍ Scribed by H. Kellerer; U. Pferschy

Book ID: 110379935
Publisher: Springer US
Year: 1999
Tongue: English
Weight: 140 KB
Volume: 92
Category: Article
ISSN: 0254-5330
DOI: 10.1023/a:1018947117526

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for on-line bin-packing probl

Algorithms for on-line bin-packing problems with cardinality constraints

✍ Luitpold Babel; Bo Chen; Hans Kellerer; Vladimir Kotov 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 291 KB

Online Bin Packing with Cardinality Cons

Online Bin Packing with Cardinality Constraints

✍ Epstein, Leah 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 233 KB

Constrained order packing: comparison of

Constrained order packing: comparison of heuristic approaches for a new bin packing problem

✍ Nikolaus Furian, Siegfried Vössner 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 476 KB

Cardinality constrained minimum cut prob

Cardinality constrained minimum cut problems: complexity and algorithms

✍ Maurizio Bruglieri; Francesco Maffioli; Matthias Ehrgott 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 377 KB

In several applications the solutions of combinatorial optimization problems (COP) are required to satisfy an additional cardinality constraint, that is to contain a ÿxed number of elements. So far the family of (COP) with cardinality constraints has been little investigated. The present work tackle

Cardinality constrained path covering pr

Cardinality constrained path covering problems in grid graphs

✍ N. Apollonio; L. Caccetta; B. Simeone 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB

Heuristic Solution of Open Bin Packing P

Heuristic Solution of Open Bin Packing Problems

✍ Ian P. Gent 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 57 KB