Rounding to an integral program

Refael Hassin; Danny Segev

doi:10.1016/j.orl.2007.11.002

Rounding to an integral program

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	321-326
Number of pages	6
Journal	Operations Research Letters
Volume	36
Issue number	3
DOIs	https://doi.org/10.1016/j.orl.2007.11.002
State	Published - May 2008
Externally published	Yes

Keywords

Approximation algorithms
Integer covering
LP-rounding

ASJC Scopus subject areas

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/j.orl.2007.11.002

Cite this

@article{8ffc50719e6d40679a91fd0120b1b5bc,

title = "Rounding to an integral program",

abstract = "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.",

keywords = "Approximation algorithms, Integer covering, LP-rounding",

author = "Refael Hassin and Danny Segev",

year = "2008",

month = may,

doi = "10.1016/j.orl.2007.11.002",

language = "English",

volume = "36",

pages = "321--326",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "3",

}

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 - Article

AN - SCOPUS:43049084428

SN - 0167-6377

VL - 36

SP - 321

EP - 326

JO - Operations Research Letters

JF - Operations Research Letters

IS - 3

ER -

Rounding to an integral program

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this