A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
- 30 September 1997
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 24 (9) , 829-847
- https://doi.org/10.1016/s0305-0548(96)00094-9
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirementsAnnals of Operations Research, 1996
- Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirementsOR Spectrum, 1995
- 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 tabu search procedure for multicommodity location/allocation with balancing requirementsAnnals of Operations Research, 1993
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing RequirementsTransportation Science, 1993
- 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
- The simple plant location problem: Survey and synthesisEuropean Journal of Operational Research, 1983
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978