✦ LIBER ✦

Approximation schemes for deal splitting and covering integer programs with multiplicity constraints

✍ Scribed by Ariel Kulik; Hadas Shachnai; Oded Shmueli; Robert Sayegh

Book ID: 113927554
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 275 KB
Volume: 412
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.09.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating covering integer programs

Approximating covering integer programs with multiplicity constraints

✍ Stavros G Kolliopoulos 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 176 KB

In a covering integer program (CIP), we seek an n-vector x of nonnegative integers, which minimizes c T • x, subject to Ax ¿ b, where all entries of A; b; c are nonnegative. In their most general form, CIPs include also multiplicity constraints of the type x 6 d, i.e., arbitrarily large integers are