A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
From MaRDI portal
Publication:1370711
DOI10.1016/S0305-0548(96)00094-9zbMath0893.90116MaRDI QIDQ1370711
Teodor Gabriel Crainic, Bernard Gendron
Publication date: 26 October 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
asynchronous exploration; multicommodity location; parallel branch-and-bound; synchronous initialization
Related Items
Positioning empty containers among multiple ports with leasing and purchasing considerations, Lower and upper bounds for a capacitated plant location problem with multicommodity flow, On estimating workload in interval branch-and-bound global optimization algorithms, New facets for the two-stage uncapacitated facility location polytope
Cites Work
- Unnamed Item
- Models for multimode multicommodity location problems with interdepot balancing requirements
- A branch-and-bound method for multicommodity location with balancing requirements
- The simple plant location problem: Survey and synthesis
- Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Dual-Based Procedure for Dynamic Facility Location
- A branch-and-bound algorithm for depot location and container fleet management
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
