The planar hub location problem: a probabilistic clustering approach
From MaRDI portal
Publication:2449351
DOI10.1007/s10479-013-1394-4zbMath1286.90083MaRDI QIDQ2449351
Publication date: 8 May 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-013-1394-4
clustering; hub location problem; Fermat-Weber problem; planar hub location; probabilistic assignments
90B80: Discrete location and assignment
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A clustering approach to the planar hub location problem
- Adapting polyhedral properties from facility to hub location problems
- Probabilistic d-clustering
- Aggregation in hub location problems
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- A generalized Weiszfeld method for the multi-facility location problem
- A quadratic integer program for the location of interacting hub facilities
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- The hub location and routing problem
- A branch and cut algorithm for hub location problems with single assignment
- Network hub location problems: The state of the art
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- On the Complexity of Some Common Geometric Location Problems
- On the Location of Hub Facilities
- Interacting New Facilities and Location-Allocation Problems
- Hub network design with single and multiple allocation: A computational study
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Heuristic Methods for Location-Allocation Problems
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
