The non-stop disjoint trajectories problem
-
Published:2024-05
Issue:
Volume:52
Page:100837
-
ISSN:1572-5286
-
Container-title:Discrete Optimization
-
language:en
-
Short-container-title:Discrete Optimization
Author:
Hoch BennoORCID,
Liers Frauke,
Neumann Sarah,
Zaragoza Martínez Francisco Javier
Reference32 articles.
1. On the computational complexity of combinatorial problems;Karp;Networks,1975
2. Packet routing on the grid;Peis,2010
3. Bruno Favennec, Eric Hoffman, Aymeric Trzmiel, François Vergne, Karim Zeghal, The point merge arrival flow integration technique: towards more complex environments and advanced continuous descent, in: 9th AIAA Aviation Technology, Integration, and Operations Conference (ATIO) and Aircraft Noise and Emissions Reduction Symposium (ANERS), 2009, p. 6921.
4. The equivalence of theorem proving and the interconnection problem;Lynch;SIGDA Newsl.,1975
5. Graph minors. XIII. The disjoint paths problem;Robertson;J. Combin. Theory Ser. B,1995