A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q1687628)
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 6821792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem |
scientific article; zbMATH DE number 6821792 |
Statements
A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (English)
0 references
4 January 2018
0 references
\(p\)-hub covering problem
0 references
binary coverage
0 references
variable neighborhood search
0 references
0.924335479736328
0 references
0.8979514241218567
0 references
0.8900086283683777
0 references
0.8560757637023926
0 references
