Abstract | ||
---|---|---|
We present several types of extended formulations for integer programs, based on irreducible integer solutions to Gomory's group relaxations. We present algorithmic schemes based on an iterative reformulation technique using these extended formulations. We give computational results for benchmark problems, which illustrate the primal and dual effect of the reformulation. |
Year | DOI | Venue |
---|---|---|
2004 | 10.1016/j.disopt.2004.06.001 | Discrete Optimization |
Keywords | Field | DocType |
gomory group relaxation,integral basis method 1991 msc: 90c10,gomory corner polyhedron,iterative reformulation technique,extended formulations,90c10,integer programming,irreducible integer solution,group relaxation,computational result,extended formulation,dual effect,integer program,benchmark problem,integral basis method,algorithmic scheme | Integer,Discrete mathematics,Cutting-plane method,Mathematical optimization,Polyhedron,Integer programming,Mathematics | Journal |
Volume | Issue | ISSN |
1 | 2 | Discrete Optimization |
Citations | PageRank | References |
4 | 0.51 | 9 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Matthias KöPpe | 1 | 191 | 20.95 |
Quentin Louveaux | 2 | 189 | 14.83 |
Robert Weismantel | 3 | 964 | 90.05 |
Laurence A. Wolsey | 4 | 2306 | 244.32 |