A Hybrid Tabu Search-Branch-and-Bound Algorithm for the Direct Flight Network Design Problem
Year of publication: |
2000
|
---|---|
Authors: | Büdenbender, Klaus ; Grünert, Tore ; Sebastian, Hans-Jürgen |
Published in: |
Transportation science : the publication of the Transportation Science Section, Operation Research Society of America. - Hanover, Md : INFORMS, ISSN 0041-1655, ZDB-ID 1609580. - Vol. 34.2000, 4, p. 364-380
|
Saved in:
Saved in favorites
Similar items by person
-
Cliques in k-partite Graphs and their Application in Textile Engineering
Grünert, Tore, (1998)
-
Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration
Funke, Birger, (2005)
-
A Note on Single Alternating Cycle Neighborhoods for the TSP
Funke, Birger, (2005)
- More ...