Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network

DOI10.1287/OPRE.30.4.725MaRDI QIDQ3947423zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

dualitypolynomial algorithmdistance constraintstree networkcovering problemfacility location on a networknonlinear p-center problemservicing centers

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Cited in

(13)

• On optimal realizations of finite metric spaces by graphs
• The discrete p-dispersion problem
• Discrete center problems
• Analytical models for locating undesirable facilities
• Facility location on a tree with maximum distance constraints
• On worst-case aggregation analysis for network location problems
• Locational analysis
• The discrete p-maxian location problem
• On optimal embeddings of metrics in graphs
• Obnoxious-facility location and data-envelopment analysis: a combined distance-based formula\-tion
• A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices
• Double bound method for solving the \(p\)-center location problem
• Comparative error bound theory for three location models: continuous demand versus discrete demand

This page was built for publication: Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3947423)