A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q1687628): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 05:35, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem |
scientific article |
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