Pages that link to "Item:Q3100698"
From MaRDI portal
The following pages link to Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees (Q3100698):
Displayed 12 items.
- Inverse 1-median problem on block graphs with variable vertex weights (Q283940) (← links)
- A linear time algorithm for inverse obnoxious center location problems on networks (Q301046) (← links)
- Inverse eccentric vertex problem on networks (Q301951) (← links)
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance (Q320084) (← links)
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486) (← links)
- Inverse \(k\)-centrum problem on trees with variable vertex weights (Q494693) (← links)
- Inverse median location problems with variable coordinates (Q623783) (← links)
- Inverse 1-center location problems with edge length augmentation on trees (Q1044223) (← 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)
- 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)