Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: GRASP / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2021.100672 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3212019837 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 23:52, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem |
scientific article |
Statements
Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (English)
0 references
29 March 2023
0 references
\(p\)-hub covering problem
0 references
\(r\)-allocation
0 references
binary and partial coverage
0 references
variable neighborhood search
0 references
greedy randomized adaptive search procedure
0 references