Pages that link to "Item:Q1885943"

The following pages link to A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks (Q1885943):

Displaying 3 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)
• Computing a maxian point of a simple rectilinear polygon (Q2643818) (← links)