Interacting New Facilities and Location-Allocation Problems
From MaRDI portal
Recommendations
Cited in
(13)- Integer programming formulations of discrete hub location problems
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- The hub location and routing problem
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Solving large single allocation p-hub problems with two or three hubs
- Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem
- The planar hub location problem: a probabilistic clustering approach
- Network hub location problems: The state of the art
- A genetic algorithm for the uncapacitated single allocation planar hub location problem
- Solving the continuous multiple allocation p-hub median problem by the hyperbolic smoothing approach
- On hub location problems in geographically flexible networks
- Locating facilities which interact: Some solvable cases
- The \(K\)-connection location problem in a plane
This page was built for publication: Interacting New Facilities and Location-Allocation Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4021784)