A branch-and-cut algorithm for the hub location and routing problem (Q337094): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2014.04.014 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2014.04.014 / rank | |||
Normal rank | |||
Latest revision as of 14:41, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for the hub location and routing problem |
scientific article |
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
