Abstract | ||
---|---|---|
We consider dual pairs of packing and covering integer linear programs. Best possible bounds are found between their optimal values. Tight inequalities are obtained relating the integral optima and the optimal rational solutions. |
Year | DOI | Venue |
---|---|---|
1985 | 10.1145/22145.22198 | STOC |
Keywords | Field | DocType |
dual integer linear program,integer linear program,optimal value,dual pair,best possible bound,tight inequality,optimal rational solution,integral optimum | Integer,Discrete mathematics,Combinatorics,Branch and cut,Integer points in convex polyhedra,Mathematics | Conference |
ISBN | Citations | PageRank |
0-89791-151-2 | 4 | 10.78 |
References | Authors | |
1 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
R. Aharoni | 1 | 47 | 25.92 |
P Erdös | 2 | 626 | 190.85 |
Nati Linial | 3 | 3872 | 602.77 |