An algorithm finding p-medians of a graph (Q3748084)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3982939
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm finding p-medians of a graph |
scientific article; zbMATH DE number 3982939 |
Statements
An algorithm finding p-medians of a graph (English)
0 references
1985
0 references
integer simplex method
0 references
quasi-integer
0 references
connected-integer polyhedra
0 references
p- median of a graph
0 references
large-dimensional problems
0 references
0.8722977
0 references
0.8684759
0 references
0 references
0.8632932
0 references
0.8631644
0 references
