Abstract.
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: November 10, 1999 / Accepted: July 6, 2001¶Published online March 27, 2002
Rights and permissions
About this article
Cite this article
Dantchev, S. Improved sorting-based procedure for integer programming. Math. Program. 92, 297–300 (2002). https://doi.org/10.1007/s101070100245
Issue date:
DOI: https://doi.org/10.1007/s101070100245