A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem (Q2783901)
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 hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem |
scientific article; zbMATH DE number 1730972
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem |
scientific article; zbMATH DE number 1730972 |
Statements
17 July 2003
0 references
A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem (English)
0 references
