Bibliography

ABA

ABACUS-A Branch And CUt System.
www.informatik.uni-koeln.de/ls_juenger/projects/abacus.htm l.

ABCC99

D. Applegate, R. Bixby, V. Chvátal, and W. Cook.
Tsp-solver ``concorde''.
http://www.keck.caam.rice.edu/concorde.html, 1999.

ACLR02

Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, and Knut Reinert.
Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics.
In Proceedings of the European Conference on Computational Biology, number Supplement 2, Saarbrücken, October 2002.

ACM$^+$03

Ernst Althaus, Gruia Calinescu, Ion Mandoiu, Sushil Prasad, Nickolay Tchervenski, and Zelikovsly Alexander.
Power efficient range assignment in ad-hoc wireless networks.
In Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC), New Orleans, USA, March 2003.

AF02

Ernst Althaus and Christian Fink.
A polyhedral approach to surface reconstruction from planar contours.
In Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, Cambridge, USA, May 2002.

AJR00

N. Ascheuer, M. Jünger, and G. Reinelt.
A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints.
Computational Optimization and Applications, 17(1):61-84, 2000.

AKLM

E. Althaus, O. Kohlbacher, H.-P. Lenhof, and P. Müller.
A combinatorial approach to protein docking with flexible side-chains.
In Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00).

AM01

E. Althaus and K. Mehlhorn.
Traveling salesman-based curve reconstruction in polynomial time.
SIAM Journal on Computing, 31(1):27-66, 2001.

BA00

F. Barahona and R. Anbil.
The volume algorithm: Producing primal solutions with a subgradient method.
Mathematical Programming A, 87, 2000.

BC94

N. Beldiceanu and E. Contejean.
Introducing global constraints in CHIP.
Mathl. Comput. Modelling, 20(12):97 - 123, 1994.

BFP95

E. Balas, M. Fischetti, and W. R. Pulleyblank.
The precedence-constrained asymmetric traveling salesman polytope.
Mathematical Programming, 68:241-265, 1995.

BJN$^+$98

C. Barnhart, E. Johnson, G. Nemhauser, M. Savelsbergh, and P. Vance.
Branch-and-price: column generation for solving huge integer programs.
Operations Research, 46:316-329, 1998.

BK98

A. Bockmayr and T. Kasper.
Branch and infer: a unifying framework for integer and finite domain constraint programming.
INFORMS Journal on Computing, 10:287-300, 1998.

CF97

A. Caprara and M. Fischetti.
Annotated bibliographies in combinatorial optimization, chapter Branch-and-cut algorithms, pages 45-64.
Wiley, 1997.

Cor02

GAMS Development Corporation.
Gams: General algebraic modeling system, 2002.

CPL

CPLEX.
www.cplex.com.

Das00

Dash Associates.
XPRESS 12 Reference Manual: XPRESS-MP Optimizer Subroutine Library XOSL, 2000.

DFJ54

G.B. Dantzig, D.R. Fulkerson, and S.M. Johnson.
Solution of a large scale traveling salesman problem.
Operations Research, 2:393-410, 1954.

DvHS$^+$88

M. Dincbas, P. van Hentenryck, H. Simonis, A. Aggoun, and T. Graf.
The constraint logic programming language CHIP.
In Fifth Generation Computer Systems, Tokyo, 1988. Springer, 1988.

EGJR01

M. Elf, C. Gutwenger, M. Jünger, and G. Rinaldi.
Computational Combinatorial Optimization, volume 2241 of Lecture Notes in Computer Science, chapter Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS, pages 157-222.
Springer, 2001.

FGK92

R. Fourer, D.M. Gay, and B.W. Kernighan.
AMPL: A modeling language for Mathematical Programming.
Duxbury Press/Wadsworth Publishing, 1992.

Gär98

Bernd Gärtner.
Exact arithmetic at low cost--a case study in linear programming.
In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 157-166, San Francisco, California, 25-27 January 1998.

GJR84

M. Grötschel, M. Jünger, and G. Reinelt.
A cutting plane algorithm for the linear ordering problem.
Operations Research, 32:1195-1220, 1984.

ILO

Ilog.
www.ilog.com.

JT00

M. Jünger and S. Thienel.
The abacus system for branch and cut and price algorithms in integer programming and combinatorial optimization.
Software Practice and Experience, 30:1325-1352, 2000.

Kas98

T. Kasper.
A Unifying Logical Framework for Integer Linear Programming and Finite Domain Constraint Programming.
PhD thesis, Fachbereich Informatik, Universität des Saarlandes, 1998.

Kwa98

C. Kwappik.
Exact linear programming.
Master's thesis, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, 1998.

LED

LEDA (Library of Efficient Data Types and Algorithms).
www.algorithmic-solutions.com.

Lem01

C. Lemaréchal.
Computational Combinatorial Optimization, volume 2241 of Lecture Notes in Computer Science, chapter Lagrangean relaxation, pages 112-156.
Springer, 2001.

MN99

K. Mehlhorn and S. Näher.
The LEDA Platform for Combinatorial and Geometric Computing.
Cambridge University Press, 1999.
1018 pages.

Nad02

D. Naddef.
The Traveling Salesman Problem and its Variations, chapter Polyhedral theory, branch and cut algorithms for the symmetric traveling salesman problem.
Kluwer Academic Publishing, 2002.

NS03

A. Neumaier and O. Shcherbina.
Safe bounds in linear and mixed-integer linear programaming.
Math. Programming, to appear, ?(?):?, 2003.

NW88

G.L. Nemhauser and L.A. Wolsey.
Integer and Combinatorial Optimization.
John Wiley & Sons, 1988.

PR91

M. Padberg and G. Rinaldi.
A branch and cut algorithm for the resolution of large scale symmetric traveling salesman problems.
SIAM Review, 33(60-10), 1991.

SDJ$^+$96

C. Simone, M. Diehl, M. Jünger, P. Mutzel, and G. Rinaldi.
Exact ground states of two-dimensional $\pm J$ ising spin glasses.
Journal of Statistical Physics, 84:1363-1371, 1996.

Smo96

G. Smolka.
Constraints in OZ.
ACM Computing Surveys, 28(4es):75, December 1996.

VBJN94

P.H. Vance, C. Barnhart, E.L. Johnson, and G. Nemhauser.
Solving binary cutting stock problems by column generation and branch-and-bound.
Computational Optimization and Applications, 3:111--130, 1994.

vHS96

P. van Hentenryck and V. Saraswat.
Strategic directions in constraint programming.
ACM Computing Surveys, 28(4):701 - 726, 1996.