1. How to cope with anomalies in parallel approximate branch-and -bound algorithms;Li,1984
2. Parallel branch-and-bound formulations for and/or tree search;Kumar,1983
3. A parallel algorithm for the one-to-all, mixed-weight, shortest path problem;Deo,1983
4. Anomalies in parallel branch-and-bound algorithms;Lai;Communications ACM,1984
5. The Cm∗ testbed;Gehringer;Computer,1982