Pages that link to "Item:Q2836087"
From MaRDI portal
The following pages link to Linear time optimal approaches for reverse obnoxious center location problems on networks (Q2836087):
Displaying 15 items.
- 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)
- Reverse 1-maxian problem with keeping existing 1-median (Q1735954) (← links)
- Inverse quickest center location problem on a tree (Q1741512) (← 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)
- An algorithm for solving the bi-objective median path-shaped facility on a tree network (Q2305157) (← links)
- The cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← links)
- Upgrading edges in the maximal covering location problem (Q2673553) (← 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)
- Reverse 1-centre problem on trees under convex piecewise-linear cost function (Q5882838) (← links)
- The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction (Q6159691) (← links)
