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 this page instead for the normal view: Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems |
scientific article |
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
