Pages that link to "Item:Q2790878"
From MaRDI portal
The following pages link to Reverse 1-center problem on weighted trees (Q2790878):
Displayed 18 items.
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486) (← links)
- Reverse selective obnoxious center location problems on tree graphs (Q1650850) (← links)
- Upgrading the 1-center problem with edge length variables on a tree (Q1662640) (← links)
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs (Q1685960) (← 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 quickest center location problem on a tree (Q1741512) (← links)
- Solving the absolute 1-center problem in the quickest path case (Q2119314) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees (Q2337353) (← links)
- Inverse and reverse balanced facility location problems with variable edge lengths on trees (Q2656494) (← links)
- The cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← links)
- A model for the inverse 1-median problem on trees under uncertain costs (Q2809658) (← 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)
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms (Q4987701) (← links)
- Further Study on Reverse 1-Center Problem on Trees (Q5149548) (← links)
- Some polynomially solvable cases of the inverse ordered 1-median problem on trees (Q5162023) (← links)