Progress in Academic Computational Integer Programming

Thorsten Koch (), Alexander Martin () and Marc E. Pfetsch ()
Additional contact information
Thorsten Koch: Konrad-Zuse-Zentrum für Informationstechnik Berlin
Alexander Martin: Friedrich-Alexander-Universität Erlangen-Nürnberg, Department Mathematik
Marc E. Pfetsch: Technische Universität Darmstadt, Fachbereich Mathematik

A chapter in Facets of Combinatorial Optimization, 2013, pp 483-506 from Springer

Abstract: Abstract This paper discusses issues related to the progress in computational integer programming. The first part deals with the question to what extent computational experiments can be reproduced at all. Afterward the performance measurement of solvers and their comparison are investigated. Then academic progress in solving mixed-integer programming at the examples of the solver SIP and its successor SCIP is demonstrated. All arguments are supported by computational results. Finally, we discuss the pros and cons of developing academic software for solving mixed-integer programs.

Keywords: Source Code; Integer Programming; Constraint Programming; Simplex Algorithm; Commercial Solver (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-38189-8_19

Ordering information: This item can be ordered from
http://www.springer.com/9783642381898

DOI: 10.1007/978-3-642-38189-8_19

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().