A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks (Q1885943)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks |
scientific article; zbMATH DE number 2115341
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks |
scientific article; zbMATH DE number 2115341 |
Statements
A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks (English)
0 references
12 November 2004
0 references
Network location
0 references
Undesirable (noxious/obnoxious) facility
0 references
Maxian problem
0 references
0 references
