A parallel branch-and-bound algorithm for multicommodity location with balancing requirements

Computers and Operations Research

Volumn 24, Issue 9, 1997, Pages 829-847

  Gendron, Bernard ^a   Crainic, Teodor Gabriel ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; COMPUTER WORKSTATIONS; DISTRIBUTED COMPUTER SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS);

MULTICOMMODITY LOCATION PROBLEM; PARALLEL BRANCH AND BOUND ALGORITHM;

PARALLEL ALGORITHMS;

EID: 0031233754     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(96)00094-9     Document Type: Article

References (18)

1. Crainic, T. G., Dejax, P. J. and Delorme, L., Models for multimode multicommodity location problems with interdepot balancing requirements. Annals of Operations Research 1989, 18, 279-302.
2. Crainic, T. G. and Delorme, L., Dual-ascent procedures for multicommodity location-allocation problems with balancing requirements. Transportation Science , 1993, 27, 2 90-101.
3. Crainic, T. G., Delorme, L. and Dejax, P. J., A branch-and-bound method for multicommodity location with balancing requirements. European Journal of Operational Research 1993, 65, 3 368-382.
4. Crainic, T. G., Gendreau, M., Soriano, P. and Toulouse, M., A tabu search procedure for multicommodity location/allocation with balancing requirements. Annals of Operations Research 1992, 41, 359-383.
5. Gendron, B. and Crainic, T. G., A branch-and-bound algorithm for depot location and container fleet management. Location Science , 1995, 3, 1 39-53.
6. Crainic, T. G., Toulouse, M. and Gendreau, M., Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements. OR Spektrum, 1995, 17, 2-3 113-123.
7. Crainic, T. G., Toulouse, M. and Gendreau, M., Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements. Annals of Operations Research 1996, 63, 277-299.
8. Gendron, B. and Crainic, T. G., Parallel implementations of a branch-and-bound algorithm for multicommodity location with balancing requirements. INFOR 1993, 31, 3 151-165.
9. Gendron, B. and Crainic, T. G., Parallel branch-and-bound algorithms: survey and synthesis. Operations Research 1994, 42, 6 1042-1066.
10. Krarup, J. and Pruzan, P. M., The simple plant location problem: survey and synthesis. European Journal of Operational Research 1983, 12, 36-81.
11. Cornuéjols, G., Nemhauser, G. L. and Wolsey, L. A., The uncapacitated facility location problem, in Discrete Location Theory, ed. R.L. Francis and P.B. Mirchandani, Wiley-Interscience, 1990, pp. 119-168.
12. Erlenkotter, D., A dual-based procedure for uncapacitated facility location. Operations Research 1978, 26, 6 992-1009.
13. Ibaraki, T., Enumerative approaches to combinatorial optimization, Annals of Operations Research, 10-11, 1987.
14. Mohan, J., A study in parallel computation: the traveling salesman problem, Report CMU-CS-82-136(R), Computer Science Department, Carnegie-Mellon University, Pittsburgh, 1982.
15. Kröger, B. and Vornberger, O., A parallel branch-and-bound approach for solving a two-dimensional cutting-stock problem, Technical Report, Department of Mathematics and Computer Science, University of Osnabrück, 1990.
16. Kumar, V., Grama, A. Y. and Nageshwara Rao, V., Scalable load balancing techniques for parallel computers. Journal of Parallel and Distributed Computing 1994, 22, 60-79.
17. Grigoriadis, M. D. and Hsu, T., RNET-The Rutgers Minimum Cost Network Flow Subroutines, Rutgers University, New Brunswick, New Jersey, 1979.
18. Van Roy, T. J. and Erlenkotter, T., A dual-based procedure for dynamic facility location. Management Science 1982, 28, 10 1091-1105.