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

DOI10.1016/S0305-0548(96)00094-9MaRDI QIDQ1370711zbMATH OpenFDO

Authors Bernard Gendron, Teodor Gabriel Crainic

Publication date 26 October 1997

Published in Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

asynchronous explorationmulticommodity locationparallel branch-and-boundsynchronous initialization

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Discrete location and assignment (90B80)

Recommendations

• Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements
• A branch-and-bound method for multicommodity location with balancing requirements
• Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem
• Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements

Cites work

• scientific article; zbMATH DE number 4202014 (Why is no real title available?)
• A Dual-Based Procedure for Dynamic Facility Location
• A Dual-Based Procedure for Uncapacitated Facility Location
• A branch-and-bound algorithm for depot location and container fleet management
• A branch-and-bound method for multicommodity location with balancing requirements
• A tabu search procedure for multicommodity location/allocation with balancing requirements
• Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
• Models for multimode multicommodity location problems with interdepot balancing requirements
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements
• Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
• Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
• The simple plant location problem: Survey and synthesis

Cited in

(14)

• Multicommodity network flows: a survey. I: Applications and formulations
• Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem
• New facets for the two-stage uncapacitated facility location polytope
• Positioning empty containers among multiple ports with leasing and purchasing considerations
• Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
• Lower and upper bounds for a capacitated plant location problem with multicommodity flow
• An approach for solving competitive location problems with variable demand using multicore systems
• Bicriteria optimization model for locating maritime container depots: application to the Port of Valencia
• Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements
• On estimating workload in interval branch-and-bound global optimization algorithms
• Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
• A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
• A parallel Branch-and-bound algorithm with restarts for solving the hierarchical covering location problem
• A branch-and-bound method for multicommodity location with balancing requirements

This page was built for publication: A parallel branch-and-bound algorithm for multicommodity location with balancing requirements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370711)