Integrating heuristic information into exact methods: the case of the vertex \(p\)-centre problem (Q4933644)
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: Integrating heuristic information into exact methods: the case of the vertex p-centre problem |
scientific article; zbMATH DE number 5799644
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Integrating heuristic information into exact methods: the case of the vertex \(p\)-centre problem |
scientific article; zbMATH DE number 5799644 |
Statements
Integrating heuristic information into exact methods: The case of the vertex p-centre problem (English)
0 references
14 October 2010
0 references
vertex \(p\)-centre
0 references
location
0 references
set covering problem (SCP)
0 references
multi-level heuristic
0 references
variable neighbourhood search (VNS)
0 references
exact method
0 references
0.7181705236434937
0 references
0.6928206086158752
0 references
0.6847782135009766
0 references
0.6785613894462585
0 references
