✦ LIBER ✦

On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover

✍ Scribed by Toshihiro Fujito

Book ID: 106406960
Publisher: Springer US
Year: 2004
Tongue: English
Weight: 150 KB
Volume: 8
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-004-4836-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation of sets based on partial c

Approximation of sets based on partial covering

✍ Zoltán Csajbók 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 310 KB

[Lecture Notes in Computer Science] Inte

[Lecture Notes in Computer Science] Integer Programming and Combinatorial Optimization Volume 1084 || Approximating k-set cover and complementary graph coloring

✍ Cunningham, William H.; McCormick, S. Thomas; Queyranne, Maurice 📂 Article 📅 1996 🏛 Springer Berlin Heidelberg ⚖ 835 KB

Combinatorial Problems of Packing and Co

Combinatorial Problems of Packing and Covering and Related Problems of Integer Linear Programming

✍ N. N. Kuzjurin 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 413 KB

A search algorithm for the minimum cost

A search algorithm for the minimum cost covering of 0–1 integer sets

✍ A. Nouh; N. Ula 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 472 KB

The equivalence of general set-covering

The equivalence of general set-covering and implicit integer programming formulations for shift scheduling

✍ Stephen E. Bechtold; Larry W. Jacobs 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 808 KB

In a recent article we demonstrated that implicit optimal modeling for shift scheduling (P2) has inherent size and execution time advantages over the general set-covering formulation for shift scheduling (PI ) [ 1 I, 131. We postulated that the absence of extraordinary overlap (EO) was a requirement

On the 0, 1 facets of the set covering p

On the 0, 1 facets of the set covering polytope

✍ Gérard Cornuéjols; Antonio Sassano 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 556 KB