A branch-and-cut algorithm for the hub location and routing problem (Q337094)
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 hub location and routing problem |
scientific article; zbMATH DE number 6650693
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the hub location and routing problem |
scientific article; zbMATH DE number 6650693 |
Statements
A branch-and-cut algorithm for the hub location and routing problem (English)
0 references
10 November 2016
0 references
hub location
0 references
routing
0 references
valid inequalities
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0 references
0.8676491379737854
0 references
0.8435294032096863
0 references
0.8288557529449463
0 references
0.826601505279541
0 references
0.8158074617385864
0 references
