Name
Abstract | ||
|---|---|---|
There exist general purpose algorithms to solve the integer linear programming problem but none of them are polynomial. Polynomially bounded rounding algorithms have been studied, but most of them are problem specific. In this paper we study a generalized rounding algorithm that is polynomial, characterize matrices that may be used in this scheme and identify a class of integer programs that it solves. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0166-218X(92)00174-K | Discrete Applied Mathematics |
Keywords | Field | DocType |
rounding algorithm,integer program | Integer,Discrete mathematics,Nearest integer function,Combinatorics,Polynomial,Algorithm,Integer points in convex polyhedra,Rounding,Integer programming,Trial division,Linear programming relaxation,Mathematics | Journal |
Volume | Issue | ISSN |
50 | 3 | Discrete Applied Mathematics |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sambhavi Lakshminarayanan | 1 | 0 | 0.34 |
| R. Chandrasekaran | 2 | 0 | 0.34 |