An iterative graph expansion approach for the scheduling and routing of airplanes
Year of publication: |
2020
|
---|---|
Authors: | Gnegel, Fabian ; Fügenschuh, Armin |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 114.2020, p. 1-11
|
Subject: | Dynamic graph expansion | Mixed integer linear programming | Time-Dependent airplane routing | Vehicle routing problem | Tourenplanung | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming |
-
The constrained shortest path tour problem
Ferone, Daniele, (2016)
-
Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs
Zhou, Yi, (2018)
-
Lateness minimization in pairwise connectivity restoration problems
Averbakh, Igor, (2018)
- More ...
-
Branch-and-refine for solving time-expanded MILP formulations
Gnegel, Fabian, (2023)
-
Dealing with time in the multiple traveling salespersons problem with moving targets
Stieber, Anke, (2020)
-
Integer linear programming models for topology optimization in sheet metal design
Fügenschuh, Armin, (2008)
- More ...