Back to SYMPHONY Home Page

References

1

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.

2

V. CHV´ATAL, Linear Programming, W.H. Freeman and Company (1983).

3

Using the CPLEX Callable Library, CPLEX Optimization Inc. (1994).

4

H. CROWDER AND M. PADBERG, Solving Large Scale Symmetric Traveling Salesman Problems to Optimality, Management Science 26 (1980), 495.

5

H. CROWDER, E.L. JOHNSON AND M. PADBERG, Solving Large-Scale Zero-One Linear Programming Problems, Operations Research 31 (1983), 803.

6

M. ESO, Parallel Branch and Cut for Set Partitioning, Ph.D. Dissertation, Field of Operations Research, Cornell University, Ithaca, N.Y., U.S.A. (1999).

7

M.R. GAREY AND D.S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., San Francisco (1979).

8

R.S. GARFINKEL AND G.L. NEMHAUSER, Integer Programming, Wiley, New York (1972).

9

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

10

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

11

G.H. GOLUB AND C.F. VAN LOAN, Matrix Computations, The Johns Hopkins University Press, Baltimore (1989).

12

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

13

D.C. KOZEN, The Design and Analysis of Algorithms, Springer-Verlag, New York (1992).

14

L. KOPMAN, A New Generic Separation Algorithm and Its Application to the Vehicle Routing Problem, Ph.D. Dissertation, Field of Operations Research, Cornell University, Ithaca, N.Y., U.S.A. (1999).

15

L. LADfANYI, Parallel Branch and Cut and Its Application to the Traveling Salesman Problem, Ph.D. Dissertation, Field of Operations Research, Cornell University, Ithaca, N.Y., U.S.A. (1996).

16

E.L. LAWLER, J.K. LENSTRA, A.H.G. RINNOOY KAN AND D.B. SHMOYS, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York (1985).

17

R. MARSTEN, The Design of The XMP Linear Programming Library, ACM Transactions on Mathematical Software 7 (1981), 481.

18

G.L. NEMHAUSER AND L.A. WOLSEY, Integer and Combinatorial Optimization, John Wiley & Sons, Inc. (1988).

19

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

20

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

21

M.W.P. SAVELSBERGH, A Branch-and-Price Algorithm for the Generalized Assignment Problem, Report COC-9302, Georgia Institute of Technology, Atlanta, Georgia (1993).

22

A. SCHRIJVER, Theory of Linear and Integer Programming, John Wiley & Sons (1986).