| Article ID: | iaor20061822 |
| Country: | Netherlands |
| Volume: | 140 |
| Issue: | 1 |
| Start Page Number: | 263 |
| End Page Number: | 304 |
| Publication Date: | Nov 2005 |
| Journal: | Annals of Operations Research |
| Authors: | Guignard Monique, Johnson Ellis L., Spielberg Kurt |
| Keywords: | programming: convex |
This paper reviews tools which have great potential for reducing the difficulty of solving IP (and also MIP) problems, if well implemented in solvers. Recent experiments with Branch and Bound solvers, in connection with “Short Start Features”, have shown that implementations need to be and can still be improved. Concepts which are likely to be especially important for (0, 1) MIP are pointed out.