Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem
- 1 January 2000
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 26 (1) , 27-46
- https://doi.org/10.1016/s0167-8191(99)00094-0
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Multicommodity Capacitated Network DesignPublished by Springer Nature ,1999
- On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First SearchAnnals of Operations Research, 1999
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirementsComputers & Operations Research, 1997
- Distributed versus Centralized Storage and Control for Parallel Branch and Bound: Mixed Integer Programming on the CM-5Computational Optimization and Applications, 1997
- A branch-and-bound algorithm for depot location and container fleet managementLocation Science, 1995
- Parallel Branch-and-Branch Algorithms: Survey and SynthesisOperations Research, 1994
- A branch-and-bound method for multicommodity location with balancing requirementsEuropean Journal of Operational Research, 1993
- Models for multimode multicommodity location problems with interdepot balancing requirementsAnnals of Operations Research, 1989
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978
- Validity of the single processor approach to achieving large scale computing capabilitiesPublished by Association for Computing Machinery (ACM) ,1967