Interacting New Facilities and Location-Allocation Problems

DOI10.1287/trsc.26.3.212zbMath0758.90053OpenAlexW2123078611MaRDI QIDQ4021784

Gary F. Brown, Turgut Aykin

Publication date: 17 January 1993

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.26.3.212

zbMATH Keywords

location-allocation

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items (12)

Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem ⋮ Solving the continuous multiple allocationp-hub median problem by the hyperbolic smoothing approach ⋮ A genetic algorithm for the uncapacitated single allocation planar hub location problem ⋮ The hub location and routing problem ⋮ On hub location problems in geographically flexible networks ⋮ The planar hub location problem: a probabilistic clustering approach ⋮ Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem ⋮ Network hub location problems: The state of the art ⋮ The capacitated multiple allocation hub location problem: Formulations and algorithms ⋮ Solving large single allocation \(p\)-hub problems with two or three hubs ⋮ Integer programming formulations of discrete hub location problems ⋮ The \(K\)-connection location problem in a plane

This page was built for publication: Interacting New Facilities and Location-Allocation Problems