Pages that link to "Item:Q283940"
From MaRDI portal
The following pages link to Inverse 1-median problem on block graphs with variable vertex weights (Q283940):
Displayed 27 items.
- 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)
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks (Q1616830) (← 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)
- Reverse 1-maxian problem with keeping existing 1-median (Q1735954) (← links)
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms (Q1788861) (← links)
- Classical and inverse median location problems under uncertain environment (Q1987593) (← 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)
- The minmax regret inverse maximum weight problem (Q2243298) (← links)
- Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective (Q2318607) (← 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 inverse 1-median location problem on uncertain tree networks with tail value at risk criterion (Q2656787) (← links)
- A generalized interval type-2 fuzzy random variable based algorithm under mean chance value at risk criterion for inverse 1-median location problems on tree networks with uncertain costs (Q2668035) (← links)
- Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems (Q4689388) (← 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)
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees (Q5238068) (← links)
- On some inverse 1-center location problems (Q5382943) (← links)
- Resource allocation in rooted trees for VLSI applications (Q5384608) (← links)