Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

Improved sorting-based procedure for integer programming.

Dantchev, S. (2002) 'Improved sorting-based procedure for integer programming.', Mathematical programming., 92 (2). pp. 297-300.

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.

Item Type:Article
Additional Information:
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
Record Created:06 Mar 2008
Last Modified:08 Apr 2009 16:22

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library