Dantchev, S. (2002) 'Improved sorting-based procedure for integer programming.', Mathematical programming., 92 (2). pp. 297-300.
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.
|Keywords:||Multiple subset-sum problem, Complete enumeration.|
|Full text:||Full text not available from this repository.|
|Publisher Web site:||http://dx.doi.org/10.1007/s101070100245|
|Date accepted:||No date available|
|Date deposited:||No date available|
|Date of first online publication:||April 2002|
|Date first made open access:||No date available|
Save or Share this output
|Look up in GoogleScholar|