Progress in Academic Computational Integer Programming

Koch T, Martin A, Pfetsch ME (2013)


Publication Language: English

Publication Status: Published

Publication Type: Book chapter / Article in edited volumes

Publication year: 2013

Publisher: Springer-Verlag Berlin Heidelberg

Edited Volumes: Facets of Combinatorial Optimization

Pages Range: 483-506

ISBN: 9783642381881

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

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.

Authors with CRIS profile

Involved external institutions

How to cite

APA:

Koch, T., Martin, A., & Pfetsch, M.E. (2013). Progress in Academic Computational Integer Programming. In Michael Jünger and Gerhard Reinelt (Eds.), Facets of Combinatorial Optimization. (pp. 483-506). Springer-Verlag Berlin Heidelberg.

MLA:

Koch, Thorsten, Alexander Martin, and Marc E. Pfetsch. "Progress in Academic Computational Integer Programming." Facets of Combinatorial Optimization. Ed. Michael Jünger and Gerhard Reinelt, Springer-Verlag Berlin Heidelberg, 2013. 483-506.

BibTeX: Download