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 46 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)
- The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
- A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937) (← links)
- Inverse 1-center location problems with edge length augmentation on trees (Q1044223) (← 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)
- Inverse quickest center location problem on a tree (Q1741512) (← 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)
- Inverse single facility location problem on a tree with balancing on the distance of server to clients (Q2076390) (← links)
- Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm (Q2205945) (← links)
- Computation of inverse 1-center location problem on the weighted trapezoid graphs (Q2212218) (← links)
- The minmax regret inverse maximum weight problem (Q2243298) (← 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)
- 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)
- Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm (Q2687446) (← 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)
- Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems (Q4689388) (← links)
- (Q4987513) (← links)
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms (Q4987701) (← links)
- Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks (Q5013391) (← 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)
- Some polynomially solvable cases of the inverse ordered 1-median problem on trees (Q5162023) (← links)
- On some inverse 1-center location problems (Q5382943) (← links)
- Resource allocation in rooted trees for VLSI applications (Q5384608) (← links)
- Reverse 1-centre problem on trees under convex piecewise-linear cost function (Q5882838) (← links)
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights (Q6053538) (← links)
- The max-sum inverse median location problem on trees with budget constraint (Q6095060) (← links)
- (Q6112991) (← links)
- The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction (Q6159691) (← links)