A branch-and-cut algorithm for the partitioning-hub location-routing problem (Q709201)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch-and-cut algorithm for the partitioning-hub location-routing problem |
scientific article; zbMATH DE number 5800841
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the partitioning-hub location-routing problem |
scientific article; zbMATH DE number 5800841 |
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
0.8655657172203064
0 references
0.8435294032096863
0 references
0.789264976978302
0 references
0.7700625658035278
0 references
0.7667766213417053
0 references
