Skip to main content
SpringerLink
Log in

Improved sorting-based procedure for integer programming

  • Published:
Mathematical Programming Submit manuscript

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.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), Dept. of Comp. Sci., University of Aarhus, Denmark, e-mail: dantchev@brics.dk, , , , , , DK

    Stefan Dantchev

Authors
  1. Stefan Dantchev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: November 10, 1999 / Accepted: July 6, 2001¶Published online March 27, 2002

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070100245

Search

Navigation