Back to SYMPHONY Home Page

Bibliography

1

D. APPLEGATE, R. BIXBY, V. CHVÁTAL, AND W. COOK, On the solution of traveling salesman problems, Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung, International Congress of Mathematicians (1998), 645.

2

D. APPLEGATE, R. BIXBY, V. CHVÁTAL, AND W. COOK, CONCORDE TSP Solver, available at www.keck.caam.rice.edu/concorde.html.

3

E. BALAS, S. CERIA, AND G. CORNUÉJOLS, Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework, Management Science 42 (1996), 9.

4

E. BALAS AND P. TOTH, Branch and Bound Methods, in E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, eds., The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York (1985), 361.

5

C. BARNHART, E.L. JOHNSON, G.L. NEMHAUSER, M.W.P. SAVELSBERGH, AND P.H. VANCE, Branch-and-Price: Column Generation for Huge Integer Programs, Operations Research 46 (1998), 316.

6

M. BENCHOUCHE, V.-D. CUNG, S. DOWAJI, B. LE CUN, T. MAUTOR, AND C. ROUCAIROL, Building a Parallel Branch and Bound Library, in Solving Combinatorial Optimization Problems in Parallel, Lecture Notes in Computer Science 1054, Springer, Berlin (1996), 201.

7

Q. CHEN AND M.C. FERRIS, FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Programming Solver, University of Wisconsin CS Department Technical Report 99-05, Madison, WI (1999).

8

Common Optimization INterface for Operations Research, http://www.coin-or.org.

9

C. CORDIER, H. MARCHAND, R. LAUNDY, AND L.A. WOLSEY, bc-opt: A Branch-and-Cut Code for Mixed Integer Programs, Mathematical Programming 86 (1999), 335.

10

ILOG CPLEX 6.5 Reference Manual, ILOG (1994).

11

J. ECKSTEIN, C.A. PHILLIPS, AND W.E. HART, PICO: An Object-Oriented Framework for Parallel Branch and Bound, RUTCOR Research Report 40-2000, Rutgers University, Piscataway, NJ (2000).

12

M. ESSO, Parallel Branch and Cut for Set Partitioning, Ph.D. Dissertation, Field of Operations Research, Cornell University, Ithaca, NY (1999).

13

A. GEIST ET AL., PVM: Parallel Virtual Machine, A User's Guide and Tutorial for Networked Parallel Computing, MIT Press, Cambridge, MA (1994).

14

B. GENDRON AND T.G. CRAINIC, Parallel Branch and Bound Algorithms: Survey and Synthesis, Operations Research 42 (1994), 1042.

15

M. GRÖTSCHEL, M. J¨UNGER, AND G. REINELT, A Cutting Plane Algorithm for the Linear Ordering Problem, Operations Research 32 (1984), 1155.

16

A. GRAMA AND V. KUMAR, Parallel Search Algorithms for Discrete Optimization Problems, ORSA Journal on Computing 7 (1995), 365.

17

K. HOFFMAN AND M. PADBERG, LP-Based Combinatorial Problem Solving, Annals of Operations Research 4 (1985/86), 145.

18

M. J¨UNGER AND S. THIENEL, The ABACUS System for Branch and Cut and Price Algorithms in Integer Programming and Combinatorial Optimization, Software Practice and Experience 30 (2000), 1325.

19

M. J¨UNGER AND S. THIENEL, Introduction to ABACUS--a branch-and-cut system, Operations Research Letters 22 (1998), 83.

20

V. KUMAR AND V.N. RAO, Parallel Depth-first Search. Part II. Analysis., International Journal of Parallel Programming 16 (1987), 501.

21

L. LAD´ANYI, T.K. RALPHS, AND L.E. TROTTER, Branch, Cut, and Price: Sequential and Parallel, Computational Combinatorial Optimization, D. Naddef and M. Jünger, eds., Springer, Berlin (2001), 223.

22

L. LAD´ANYI, T.K. RALPHS, AND M.J. SALTZMAN, A Library Hierarchy for Implementing Scalable Parallel Search Algorithms, available at http://www.lehigh.edu/~ tkr2/pubs.html

23

J. LINDEROTH, Topics in Parallel Integer Optimization, Ph.D. Dissertation, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA (1998).

24

A. MARTIN, Integer Programs with Block Structure, Habilitation Thesis, Technical University of Berlin, Berlin, Germany (1998).

25

G.L. NEMHAUSER, M.W.P. SAVELSBERGH, AND G.S. SIGISMONDI, MINTO, a Mixed INTeger Optimizer, Operations Research Letters 15 (1994), 47.

26

G.L. NEMHAUSER AND L.A. WOLSEY, Integer and Combinatorial Optimization, Wiley, New York (1988).

27

M. PADBERG AND G. RINALDI, A Branch-and-Cut Algorithm for the Resolution of Large-Scale Traveling Salesman Problems, SIAM Review 33 (1991), 60.

28

T.K. RALPHS, Parallel Branch and Cut for Vehicle Routing, Ph.D. Dissertation, Field of Operations Research, Cornell University, Ithaca, NY (1995).

29

T.K. RALPHS AND L. LAD´ANYI, Computational Experience with Branch, Cut, and Price: Sequential and Parallel, in preparation.

30

T.K. RALPHS AND L. LAD´ANYI, SYMPHONY: A Parallel Framework for Branch and Cut, White paper, Rice University (1999).

31

V.N. RAO AND V. KUMAR, Parallel Depth-first Search. Part I. Implementation., International Journal of Parallel Programming 16 (1987), 479.

32

Y. SHINANO, M. HIGAKI, AND R. HIRABAYASHI, Generalized Utility for Parallel Branch and Bound Algorithms, Proceedings of the 1995 Seventh Symposium on Parallel and Distributed Processing, IEEE Computer Society Press, Los Alamitos, CA (1995), 392.

33

Y. SHINANO, K. HARADA, AND R. HIRABAYASHI, Control Schemes in a Generalized Utility for Parallel Branch and Bound, Proceedings of the 1997 Eleventh International Parallel Processing Symposium, IEEE Computer Society Press, Los Alamitos, CA (1997), 621.

34

S. TSCHÖKE AND T. POLZER, Portable Parallel Branch and Bound Library User Manual, Library Version 2.0, Department of Computer Science, University of Paderborn.