New class of 0-1 integer programs with tight approximation via linear relaxations

A. S. Asratian and N. N. Kuzjurin

Mathematical Methods of Operations Research, 2001, vol. 53, issue 3, 363-370

Abstract: We consider the problem of estimating optima of integer programs { max cx | A x≤ b, 0≤ x≤ 1, x− integral} where b> 0, c≥ 0 are rational vectors and A is an arbitrary rational m×n matrix. Using randomized rounding we find an efficiently verifiable sufficient condition for optima of such integer programs to be close to the optima q of their linear relaxations. We show that our condition guarantees that for any constant ε>0 and sufficiently large n there exists a feasible integral solution z such that q≥ cz≥(1−ε)q. Copyright Springer-Verlag Berlin Heidelberg 2001

Keywords: Key words: integer programming; approximation; randomized rounding (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860100115 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:53:y:2001:i:3:p:363-370

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860100115

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().