Pages that link to "Item:Q1685960"
From MaRDI portal
The following pages link to Optimal algorithms for inverse vertex obnoxious center location problems on graphs (Q1685960):
Displayed 11 items.
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks (Q1616830) (← links)
- Reverse 1-maxian problem with keeping existing 1-median (Q1735954) (← links)
- Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks (Q2033986) (← links)
- Inverse single facility location problem on a tree with balancing on the distance of server to clients (Q2076390) (← links)
- Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks (Q2158608) (← links)
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms (Q2632017) (← 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)
- 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)
