Pages that link to "Item:Q301046"
From MaRDI portal
The following pages link to A linear time algorithm for inverse obnoxious center location problems on networks (Q301046):
Displaying 25 items.
- Inverse 1-median problem on block graphs with variable vertex weights (Q283940) (← links)
- Reverse selective obnoxious center location problems on tree graphs (Q1650850) (← 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)
- The inverse 1-center problem on cycles with variable edge lengths (Q1725838) (← links)
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks (Q1730835) (← links)
- Inverse quickest center location problem on a tree (Q1741512) (← links)
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms (Q1788861) (← links)
- Inverse anti-\(k\)-centrum problem on networks with variable edge lengths (Q1988619) (← links)
- Inverse group 1-median problem on trees (Q2031325) (← links)
- Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks (Q2033986) (← links)
- Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks (Q2158608) (← links)
- Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm (Q2205945) (← links)
- The minmax regret inverse maximum weight problem (Q2243298) (← links)
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms (Q2632017) (← links)
- The cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← 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)
- (Q4987513) (← links)
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms (Q4987701) (← links)
- Optimal algorithms for some inverse uncapacitated facility location problems on networks (Q5043849) (← links)
- Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance (Q5085261) (← links)
- The max-sum inverse median location problem on trees with budget constraint (Q6095060) (← links)
- Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm (Q6191111) (← links)