Pages that link to "Item:Q5238068"
From MaRDI portal
The following pages link to Optimal algorithms for selective variants of the classical and inverse median location problems on trees (Q5238068):
Displaying 7 items.
- The cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← links)
- Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm (Q2687446) (← 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)
- Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights (Q6049306) (← links)
- Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks (Q6080433) (← links)
- On the complexity of the upgrading version of the maximal covering location problem (Q6541022) (← links)
