Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283)
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 6839487
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems |
scientific article; zbMATH DE number 6839487 |
Statements
Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (English)
0 references
15 February 2018
0 references
\(p\)-hub maximal covering problem
0 references
binary and partial coverage
0 references
mixed integer programming
0 references
variable neighborhood search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9149439334869384
0 references
0.8900086283683777
0 references
0.8489165306091309
0 references
0.8309553861618042
0 references
