A deterministic algorithm for solving the Weber problem for an \(n\)-sequentially connected chain (Q5263835)
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 6460068
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A deterministic algorithm for solving the Weber problem for an \(n\)-sequentially connected chain |
scientific article; zbMATH DE number 6460068 |
Statements
17 July 2015
0 references
Weber problem
0 references
\(n\)-sequentially connected chain
0 references
dynamic programming
0 references
exact algorithm
0 references
0.8117190003395081
0 references
