The absolute centre of a graph (Q793644)
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 3856852
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The absolute centre of a graph |
scientific article; zbMATH DE number 3856852 |
Statements
The absolute centre of a graph (English)
0 references
1984
0 references
The problem of finding the absolute centre of a graph, which arises for example, in the selection of a site for an emergency-service centre, involves the global minimisation of certain piecewise-linear non-convex continuous functions. Using an algebraic characterization of the local minima of these functions, the author converts the continuous optimization problem into a combinatorial problem. An 0(n log n) algorithm is presented for solving this combinatorial problem.
0 references
computational complexity
0 references
facility location
0 references
absolute centre of a graph
0 references
global minimisation
0 references
piecewise-linear non-convex continuous functions
0 references
0.8396250009536743
0 references
0.8335237503051758
0 references
0.8110266327857971
0 references
0.8072211146354675
0 references
