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

Authors:
Bernard Gendron;Teodor Gabriel Crainic
Affiliations:
-;-
Venue:
Computers and Operations Research
Year:
1997

Citing 0
Cited 4

Solving hub arc location problems on a cluster of workstations

Parallel Computing - Special issue: Parallel computing in logistics
A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements

Parallel Computing - Special issue: Parallel computing in logistics
Lower and upper bounds for a capacitated plant location problem with multicommodity flow

Computers and Operations Research
New facets for the two-stage uncapacitated facility location polytope

Computational Optimization and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract