A branch-and-cut algorithm for the partitioning-hub location-routing problem (Q709201): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2010.07.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2134567220 / rank | |||
Normal rank | |||
Revision as of 21:26, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for the partitioning-hub location-routing problem |
scientific article |
Statements
A branch-and-cut algorithm for the partitioning-hub location-routing problem (English)
0 references
15 October 2010
0 references
size constrained clique partitioning
0 references
graph partitioning
0 references
communication networks
0 references
hub-location
0 references
branch-and-cut
0 references
