Progress in computational mixed integer programming—A look back from the other side of the tipping point
- 10 January 2007
- journal article
- Published by Springer Science and Business Media LLC in Annals of Operations Research
- Vol. 149 (1), 37-41
- https://doi.org/10.1007/s10479-006-0091-y
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Aggregation and Mixed Integer Rounding to Solve MIPsOperations Research, 2001
- Conflict graphs in solving integer programming problemsEuropean Journal of Operational Research, 2000
- MIP: Theory and Practice — Closing the GapPublished by Springer Science and Business Media LLC ,2000
- Lifted flow cover inequalities for mixed 0-1 integer programsMathematical Programming, 1999
- An Efficient Algorithm for Solving an Air Traffic Management Model of the National Airspace SystemINFORMS Journal on Computing, 1998
- Gomory cuts revisitedOperations Research Letters, 1996
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-CutINFORMS Journal on Computing, 1991
- Valid Linear Inequalities for Fixed Charge ProblemsOperations Research, 1985
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- Disjunctive ProgrammingPublished by Elsevier BV ,1979