✦ LIBER ✦

(1,k)-configurations and facets for packing problems

✍ Scribed by Manfred W. Padberg

Publisher: Springer-Verlag
Year: 1980
Tongue: English
Weight: 268 KB
Volume: 18
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01588301

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

(1,k)-configuration facets for the gener

(1,k)-configuration facets for the generalized assignment problem

✍ Elsie Sterbin Gottlieb; M. R. Rao 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 294 KB

Algorithms for packing and scheduling pr

Algorithms for packing and scheduling problems

✍ Michele Monaci 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 37 KB

Packing and Decomposition Problems for P

Packing and Decomposition Problems for Polynomial Association Schemes

✍ V.I. Levenshtein 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 496 KB

We consider \(P\) - and \(Q\)-polynomial association schemes and introduce definitions of Delsarte codes and decomposable schemes. Many known combinatorial notions can be defined as Delsarte codes in suitable association schemes, and almost all classical association schemes turn out to be decomposab

Approximation schemes for ordered vector

Approximation schemes for ordered vector packing problems

✍ Alberto Caprara; Hans Kellerer; Ulrich Pferschy 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

A linear time algorithm for restricted b

A linear time algorithm for restricted bin packing and scheduling problems

✍ J. Baewicz; K. Ecker 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Central configurations and total collisi

Central configurations and total collisions for quasihomogeneous -body problems

✍ Florin Diacu; Ernesto Pérez-Chavela; Manuele Santoprete 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 254 KB