A Development and Deployment Framework for Distributed Branch-and-Bound

[1]  Reinhard Lüling,et al.  Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network , 1995, Proceedings of 9th International Parallel Processing Symposium.

[2]  Yuji Shinano,et al.  A generalized utility for parallel branch and bound algorithms , 1995, Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing.

[3]  Peter R. Cappello,et al.  JICOS: A Java-Centric Network Computing Service , 2005, IASTED PDCS.

[4]  Michael O. Neary,et al.  Javelin 2.0: Java-Based Parallel Computing on the Internet , 2000, Euro-Par.

[5]  Jason Maassen,et al.  Fault-Tolerant Scheduling of Fine-Grained Tasks in Grid Environments , 2006, Int. J. High Perform. Comput. Appl..

[6]  Benjamin W. Wah,et al.  Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search , 1985, IEEE Transactions on Software Engineering.

[7]  Peter R. Cappello,et al.  CX: A scalable, robust network for parallel computing , 2002, Sci. Program..

[8]  Peter R. Cappello,et al.  Advanced eager scheduling for Java‐based adaptive parallel computing , 2005, Concurr. Pract. Exp..

[9]  Geppino Pucci,et al.  Fast Deterministic Parallel Branch-and-Bound , 1999, Parallel Process. Lett..

[10]  Benjamin W. Wah,et al.  Multiprocessing of Combinatorial Search Problems , 1985, Computer.

[11]  Peter R. Cappello,et al.  Advanced eager scheduling for Java‐based adaptive parallel computing , 2002, JGI '02.

[12]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

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

[14]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[15]  S. Dowaji,et al.  A self-stabilizing distributed branch-and-bound algorithm , 1996, Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications.

[16]  Alan J. Hoffman,et al.  Aspects of the Traveling Salesman Problem , 1984, IBM J. Res. Dev..

[17]  Ian T. Foster,et al.  A problem-specific fault-tolerance mechanism for asynchronous, distributed systems , 2000, Proceedings 2000 International Conference on Parallel Processing.

[18]  Peter R. Cappello,et al.  A scalable, robust network for parallel computing , 2001, JGI '01.

[19]  K. G. Murty,et al.  An Algorithm for the Traveling Salesman Problem , 2019 .

[20]  Salvatore Venticinque,et al.  Mobile Agent Programming for Clusterswith Parallel Skeletons , 2002, VECPAR.

[21]  Richard M. Karp,et al.  A randomized parallel branch-and-bound procedure , 1988, STOC '88.

[22]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[23]  Randi Moe,et al.  GRIBB - Branch-and-Bound Methods on the Internet , 2003, PPAM.

[24]  Coromoto León,et al.  Parallel skeletons for divide-and-conquer and branch-and-bound techniques , 2003, Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings..

[25]  Greg N. Frederickson,et al.  An Optimal Algorithm for Selection in a Min-Heap , 1993, Inf. Comput..

[26]  Bradley C. Kuszmaul,et al.  Cilk: an efficient multithreaded runtime system , 1995, PPOPP '95.

[27]  William Aiello,et al.  An atomic model for message-passing , 1993, SPAA '93.