๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximability of Sparse Integer Programs

โœ Scribed by David Pritchard; Deeparnab Chakrabarty

Publisher
Springer
Year
2010
Tongue
English
Weight
687 KB
Volume
61
Category
Article
ISSN
0178-4617

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

Integer Programming as a Framework for O
Integer Programming as a Framework for Optimization and Approximability
โœ Ian Barland; Phokion G Kolaitis; Madhukar N Thakur ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 599 KB

Structural approximation theory seeks to provide a framework for expressing optimization problems and isolating structural or syntactic conditions that explain the apparent difference in the approximation properties of different NP-optimization problems. In this paper, we initiate a study of structu