The following pages link to Reverse 2-median problem on trees (Q943832):
Displaying 18 items.
- Notes on inverse bin-packing problems (Q458387) (← links)
- Upgrading \(p\)-median problem on a path (Q894530) (← links)
- The inverse 1-maxian problem with edge length modification (Q941835) (← links)
- The inverse Fermat-Weber problem (Q976390) (← links)
- Up- and downgrading the 1-center in a network (Q1026756) (← links)
- Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs (Q1697898) (← links)
- Reverse 1-maxian problem with keeping existing 1-median (Q1735954) (← links)
- Inverse and reverse balanced facility location problems with variable edge lengths on trees (Q2656494) (← links)
- Upgrading edges in the maximal covering location problem (Q2673553) (← links)
- Reverse 1-center problem on weighted trees (Q2790878) (← links)
- Linear time optimal approaches for reverse obnoxious center location problems on networks (Q2836087) (← links)
- Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems (Q4689388) (← links)
- Optimal algorithms for some inverse uncapacitated facility location problems on networks (Q5043849) (← links)
- Further Study on Reverse 1-Center Problem on Trees (Q5149548) (← links)
- Reverse 1-centre problem on trees under convex piecewise-linear cost function (Q5882838) (← links)
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights (Q6053538) (← links)
- The max-sum inverse median location problem on trees with budget constraint (Q6095060) (← links)
- The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction (Q6159691) (← links)
