Pages that link to "Item:Q3947423"
From MaRDI portal
The following pages link to Duality and Distance Constraints for the Nonlinear <i>p</i>-Center Problem and Covering Problem on a Tree Network (Q3947423):
Displaying 13 items.
- Double bound method for solving the \(p\)-center location problem (Q336682) (← links)
- Comparative error bound theory for three location models: continuous demand versus discrete demand (Q458944) (← links)
- On worst-case aggregation analysis for network location problems (Q689246) (← links)
- On optimal embeddings of metrics in graphs (Q794666) (← links)
- The discrete p-dispersion problem (Q915643) (← links)
- On optimal realizations of finite metric spaces by graphs (Q1100481) (← links)
- Analytical models for locating undesirable facilities (Q1118522) (← links)
- Locational analysis (Q1173002) (← links)
- The discrete p-maxian location problem (Q1824542) (← links)
- Obnoxious-facility location and data-envelopment analysis: a combined distance-based formula\-tion (Q1847216) (← links)
- Facility location on a tree with maximum distance constraints (Q1919972) (← links)
- A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices (Q3320428) (← links)
- Discrete Center Problems (Q5506720) (← links)
