Complexity of local search for the \(p\)-median problem (Q932191)
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: Complexity of local search for the p-median problem |
scientific article; zbMATH DE number 5299385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of local search for the \(p\)-median problem |
scientific article; zbMATH DE number 5299385 |
Statements
Complexity of local search for the \(p\)-median problem (English)
0 references
10 July 2008
0 references
local search
0 references
PLS-completeness
0 references
pivoting rules
0 references
Karush-Kuhn-Tucker conditions
0 references
0-1 local saddle points
0 references
pseudo-Boolean functions
0 references
0.9347479939460754
0 references
0.8128527402877808
0 references
0.8011871576309204
0 references
0.8006102442741394
0 references
