"The ABACUS System for Branch-and-Cut-and-Price Algorithms in Integer Programming and Combinatorial Optimization"
Article by Michael Jünger, Stefan Thienel, available as BibTeX Source, postscript file and compressed postscript file.
Zentrum für Angewandte Informatik Köln, Lehrstuhl Jünger
Preprint Key:	zpr98-322
Keywords:	branch-and-cut, branch-and-price, combinatorial optimization, object oriented design, software frameworks
This article was published in 2000 in the journal "Software: Practice and Experience", volume 30, pages 1325-1352.
Abstract:	The development of new mathematical theory and its application in software systems for the solution of hard optimization problems have a long tradition in mathematical programming. In this tradition we implemented ABACUS, an object-oriented software framework for branch-and-cut-and-price algorithms for the solution of mixed integer and combinatorial optimization problems. This paper discusses some difficulties in the implementation of branch-and-cut-and-price algorithms for combinatorial optimization problems and shows how they are managed by ABACUS.