Name
Abstract | ||
|---|---|---|
This paper introduces a new algorithm for solving mixed integer programs. The core of the method is an iterative technique for changing the representation of the original mixed integer optimization problem. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/s10107-003-0405-7 | Math. Program. |
Keywords | Field | DocType |
Mixed integer programming,primal methods,integral basis method | Nearest integer function,Mathematical optimization,Branch and price,Branch and cut,Algorithm,Integer relation algorithm,Combinatorial optimization,Integer programming,Optimization problem,Mathematics,Special ordered set | Journal |
Volume | Issue | ISSN |
98 | 1-3 | 0025-5610 |
Citations | PageRank | References |
2 | 0.42 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthias KöPpe | 1 | 191 | 20.95 |
| Robert Weismantel | 2 | 964 | 90.05 |