✦ LIBER ✦

Polytopes, permutation shapes and bin packing

✍ Scribed by Marguerite A. Eisenstein-Taylor

Book ID: 108421661
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 123 KB
Volume: 30
Category: Article
ISSN: 0196-8858
DOI: 10.1016/s0196-8858(02)00526-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graph substitution and set packing polyt

Graph substitution and set packing polytopes

✍ E. Balas; E. Zemel 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 599 KB

## Abstract Facets of the set packing polytope provide strong cutting planes for set packing and partitioning problems. Set packing polytopes are in a one‐to‐one correspondence with graphs. The facets of P(G), the set packing polytope associated with the graph G, are related to certain subgraphs of

Packing of graphs and permutations

✍ Mariusz Woźniak 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Bin-packing and matchings in threshold g

Bin-packing and matchings in threshold graphs

✍ G. Tinhofer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 538 KB

Improved Approximation Algorithms for Ma

Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems

✍ Mingen Lin; Yang Yang; Jinhui Xu 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 430 KB

Packing of graphs and permutations—a sur

Packing of graphs and permutations—a survey

✍ Mariusz Woźniak 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 434 KB

On d-threshold graphs and d-dimensional

On d-threshold graphs and d-dimensional bin packing

✍ Alberto Caprara; Andrea Lodi; Romeo Rizzi 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB