Closest assignment constraints and location models: Properties and structure

DOI10.1016/S0966-8349(97)00001-6zbMath0930.90054OpenAlexW1972198184MaRDI QIDQ4228769

Richard L. Church, Ross A. Gerrard

Publication date: 1 March 1999

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

Full work available at URL: https://doi.org/10.1016/s0966-8349(97)00001-6

zbMATH Keywords

coveringmediancentral place theorylocation-allocation modelsclosest assignment constraints

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (15)

A Lagrangean decomposition for the maximum independent set problem applied to map labeling ⋮ The maximin HAZMAT routing problem ⋮ Location-allocation approaches for hospital network planning under uncertainty ⋮ A strengthened formulation for the simple plant location problem with order ⋮ Customer allocation in maximum capture problems ⋮ The budget constrained \(r\)-interdiction median problem with capacity expansion ⋮ Organizing hospitals into networks: a hierarchical and multiservice model to define location, supply and referrals in planned hospital systems ⋮ Closest assignment constraints in discrete location problems ⋮ A hierarchical location model for public facility planning ⋮ A bilevel mixed-integer program for critical infrastructure protection planning ⋮ Lagrangean relaxation with clusters for point-feature cartographic label placement problems ⋮ Location of courts of justice: the making of the new judiciary map of Portugal ⋮ Multiple allocation hub interdiction and protection problems: model formulations and solution approaches ⋮ A robust disaster preparedness model for effective and fair disaster response ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms

This page was built for publication: Closest assignment constraints and location models: Properties and structure