The following pages link to Medi-Centers of a Tree (Q3755207):
Displaying 21 items.
- Comparative error bound theory for three location models: continuous demand versus discrete demand (Q458944) (← links)
- Algorithms for connected \(p\)-centdian problem on block graphs (Q724753) (← links)
- The zone-constrained location problem on a network (Q809885) (← links)
- A polynomial algorithm for the multicriteria cent-dian location problem (Q864019) (← links)
- Algorithms for central-median paths with bounded length on trees (Q864041) (← links)
- The 2-radius and 2-radiian problems on trees (Q955029) (← links)
- Axiomatic considerations in multi-objective location theory (Q1107412) (← links)
- A multicriteria approach to the location of public facilities (Q1138985) (← links)
- Reducibility of minimax to minisum 0-1 programming problems (Q1148229) (← links)
- The obnoxious \(p\) facility network location problem with facility interaction (Q1291604) (← links)
- A geometrical solution for quadratic bicriteria location models (Q1296369) (← links)
- The centdian subtree on tree networks (Q1602695) (← links)
- Revisiting \(k\)-sum optimization (Q1675256) (← links)
- Location analysis: a synthesis and survey (Q1776950) (← links)
- Group centre and group median of a tree (Q1804070) (← links)
- Minimizing the sum of the \(k\) largest functions in linear time. (Q1853685) (← links)
- Multiobjective analysis of facility location decisions (Q2638929) (← links)
- Review of obnoxious facilities location problems (Q2669654) (← links)
- The Connected p-Centdian Problem on Block Graphs (Q3467867) (← links)
- Comments on ‘Facility location problem on network under multiple criteria fuzzy set theoretic approach’ (Q3494374) (← links)
- Worst-case incremental analysis for a class ofp-facility location problems (Q4537620) (← links)
