Pages that link to "Item:Q623783"
From MaRDI portal
The following pages link to Inverse median location problems with variable coordinates (Q623783):
Displaying 21 items.
- A linear time algorithm for inverse obnoxious center location problems on networks (Q301046) (← links)
- Inverse 1-median problem on trees under weighted Hamming distance (Q445338) (← links)
- Inverse \(k\)-centrum problem on trees with variable vertex weights (Q494693) (← links)
- Inverse \(p\)-median problems with variable edge lengths (Q532535) (← links)
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees (Q534329) (← links)
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks (Q1616830) (← 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)
- 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 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)
- Reverse 1-center problem on weighted trees (Q2790878) (← links)
- Inverse min-max spanning r-arborescence problem under the weighted sum-type Hamming distance (Q2818313) (← 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)
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees (Q5238068) (← links)
- Mathematical models for the variable weights version of the inverse minimax circle location problem (Q5855728) (← links)
- Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks (Q6080433) (← links)
- The reverse selective balance center location problem on trees (Q6191728) (← links)