| Article ID: | iaor20031179 |
| Country: | Germany |
| Volume: | 92 |
| Issue: | 2 |
| Start Page Number: | 297 |
| End Page Number: | 300 |
| Publication Date: | Jan 2002 |
| Journal: | Mathematical Programming |
| Authors: | Dantchev S. |
Recently, Cornuéjols and Dawande have considered a special class of 0–1 programs that turns out to be hard for existing IP solvers. One of them is a sorting-based algorithm, based on an idea of Wolsey. In this paper, we show how to improve both the running time and the space requirements of this algorithm. The drastic reduction of space needed allows us to solve much larger instances than was possible before using this technique.