Name
Abstract | ||
|---|---|---|
This paper introduces an exact algorithm for solving intege r programs, neither using cutting planes nor enumeration techniques. It is a primal au gmentation algorithm that relies on iteratively substituting one column by columns that correspond to irreducible solutions of certain linear diophantine inequalities. We p rove that our algorithm is finite and demonstrate its potential by testing it on some ins tances of the MIPLIB with several hundred variables. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/s001860100124 | Mathematical Methods of Operations Research |
Keywords | Field | DocType |
cutting plane | Integer,Mathematical optimization,Cutting-plane method,Exact algorithm,Enumeration,Integer programming,Integral method,Diophantine equation,Mathematics,Diophantine approximation | Journal |
Volume | Issue | ISSN |
53 | 3 | 1432-2994 |
Citations | PageRank | References |
13 | 1.14 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Utz-Uwe Haus | 1 | 226 | 18.47 |
| M. Köppe | 2 | 71 | 5.38 |
| Robert Weismantel | 3 | 964 | 90.05 |