Pages that link to "Item:Q1885943"
From MaRDI portal
The following pages link to A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks (Q1885943):
Displaying 6 items.
- Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study (Q832797) (← links)
- An \(O(mn)\) algorithm for the anti-cent-dian problem (Q864778) (← links)
- An \(O(mn)\) algorithm for the 1-maximin problem on a network (Q1304521) (← links)
- A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric (Q2267315) (← links)
- Computing a maxian point of a simple rectilinear polygon (Q2643818) (← links)
- A new algorithm for the undesirable 1-center problem on networks (Q4656761) (← links)
