A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q1687628): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2017.03.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2605930844 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Integer programming formulations of discrete hub location problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scatter search for an uncapacitated \(p\)-hub median problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Model formulations for hub covering problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Allocation strategies in hub networks / rank | |||
Normal rank | |||
Latest revision as of 22:19, 14 July 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
