An aggregation approach to solving the networkp-median problem with link demands

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0037(200012)36:4<233::AID-NET4>3.0.CO;2-I" /><233::AID-NET4>3.0.CO;2-I 10.1002/1097-0037(200012)36:4<233::AID-NET4>3.0.CO;2-IzbMath0985.90017OpenAlexW2092151489MaRDI QIDQ4761323

Peiwu Zhao, Rajan Batta

Publication date: 3 June 2002

Full work available at URL: https://doi.org/10.1002/1097-0037(200012)36:4<233::aid-net4>3.0.co;2-i

zbMATH Keywords

aggregationnetwork location\(p\)-medianlink demands

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (4)

A framework for demand point and solution space aggregation analysis for location models ⋮ On covering location problems on networks with edge demand ⋮ Covering edges in networks ⋮ Aggregation error for location models: Survey and analysis

This page was built for publication: An aggregation approach to solving the networkp-median problem with link demands