Pages that link to "Item:Q534329"
From MaRDI portal
The following pages link to Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees (Q534329):
Displaying 24 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)
- The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks (Q1616830) (← 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)
- 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)
- Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm (Q2205945) (← links)
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms (Q2330101) (← links)
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees (Q2337353) (← 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)
- 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)
- The max-sum inverse median location problem on trees with budget constraint (Q6095060) (← links)