The ABACUS System for Branch-and-Cut-and-Price Algorithms in Integer Programming and Combinatorial Optimization

Jünger, Michael and Thienel, Stefan (2000) The ABACUS System for Branch-and-Cut-and-Price Algorithms in Integer Programming and Combinatorial Optimization.
Published in: Software: Practice and Experience Vol. 30 (11). pp. 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.


Actions:
Download: [img] Postscript - Preprinted Version
Download (264Kb) | Preview
Export as:
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zpr98-322
Depositing User: Prof. Dr. Michael Jünger
Date Deposited: 24 Jun 2003 00:00
Last Modified: 16 Jan 2012 14:07
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/322