Pages that link to "Item:Q732826"
From MaRDI portal
The following pages link to Inverse center location problem on a tree (Q732826):
Displayed 15 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 \(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)
- Inverse median location problems with variable coordinates (Q623783) (← links)
- Inverse 1-center location problems with edge length augmentation on trees (Q1044223) (← 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)
- 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 obnoxious \(p\)-median location problems on trees with edge length modifications under different norms (Q2632017) (← links)
- Linear time optimal approaches for reverse obnoxious center location problems on networks (Q2836087) (← links)
- Inverse center location problems (Q2883558) (← links)
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees (Q3100698) (← links)
- Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems (Q4689388) (← links)