Branch-and-bound and parallel computation: A historical note

[1]  Alan P. Sprague,et al.  Performance of parallel branch-and-bound algorithms , 1985, IEEE Transactions on Computers.

[2]  Benjamin W. Wah,et al.  Coping with Anomalies in Parallel Branch-and-Bound Algorithms , 1986, IEEE Transactions on Computers.

[3]  Alan P. Sprague,et al.  A Note on Anomalies in Parallel Branch-and-Bound Algorithms with One-to-One Bounding Functions , 1986, Inf. Process. Lett..

[4]  Udi Manber,et al.  DIB—a distributed implementation of backtracking , 1987, TOPL.

[5]  Alexander H. G. Rinnooy Kan,et al.  A simulation tool for the performance evaluation of parallel branch and bound algorithms , 1988, Math. Program..

[6]  Robert S. Garfinkel,et al.  Technical Note - On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem , 1973, Oper. Res..

[7]  Benjamin W. Wah,et al.  MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems , 1984, IEEE Transactions on Computers.

[8]  Jan Karel Lenstra,et al.  An introduction to parallelism in combinatorial optimization , 1986, Discret. Appl. Math..

[9]  Sartaj Sahni,et al.  Anomalies in Parallel Branch-and-Bound Algorithms , 1984 .

[10]  Harry W. J. M. Trienekens,et al.  Experiments with Parallel Algorithms for Combinatorial Problems , 1985 .

[11]  J. K. Lenstra,et al.  Combinatorial optimization : annotated bibliographies , 1985 .

[12]  H.W.J.M. Trienekens.  Parallel branch and bound on an MIMD system , 1986 .

[13]  Joseph Mohan,et al.  Experience with Two Parallel Programs Solving the Traveling Salesman Problem , 1983, ICPP.

[14]  Jan Karel Lenstra,et al.  Parallel computing in combinatorial optimization , 1988 .