Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
From MaRDI portal
Publication:3947423
DOI10.1287/opre.30.4.725zbMath0486.90037OpenAlexW2107488693MaRDI QIDQ3947423
No author found.
Publication date: 1982
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.30.4.725
dualitypolynomial algorithmdistance constraintstree networkcovering problemfacility location on a networknonlinear p-center problemservicing centers
Related Items
On optimal realizations of finite metric spaces by graphs ⋮ Double bound method for solving the \(p\)-center location problem ⋮ Analytical models for locating undesirable facilities ⋮ Facility location on a tree with maximum distance constraints ⋮ The discrete p-dispersion problem ⋮ Comparative error bound theory for three location models: continuous demand versus discrete demand ⋮ Locational analysis ⋮ A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices ⋮ On worst-case aggregation analysis for network location problems ⋮ The discrete p-maxian location problem ⋮ Discrete Center Problems ⋮ Obnoxious-facility location and data-envelopment analysis: a combined distance-based formula\-tion ⋮ On optimal embeddings of metrics in graphs
This page was built for publication: Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
