TY - JOUR
T1 - Rounding to an integral program
AU - Hassin, Refael
AU - Segev, Danny
PY - 2008/5
Y1 - 2008/5
N2 - This paper presents a framework for approximating NP-hard problems that can be formulated as integer-covering programs, possibly with additional side constraints, and the number of covering options is restricted in some sense, although this property may be well hidden.
AB - This paper presents a framework for approximating NP-hard problems that can be formulated as integer-covering programs, possibly with additional side constraints, and the number of covering options is restricted in some sense, although this property may be well hidden.
KW - Approximation algorithms
KW - Integer covering
KW - LP-rounding
UR - http://www.scopus.com/inward/record.url?scp=43049084428&partnerID=8YFLogxK
U2 - 10.1016/j.orl.2007.11.002
DO - 10.1016/j.orl.2007.11.002
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:43049084428
SN - 0167-6377
VL - 36
SP - 321
EP - 326
JO - Operations Research Letters
JF - Operations Research Letters
IS - 3
ER -