The non-stop disjoint trajectories problem
From MaRDI portal
Publication:6564192
DOI10.1016/J.DISOPT.2024.100837MaRDI QIDQ6564192
[[Person:6075884|Author name not available (Why is that?)]], F. J. Zaragoza Martínez, Sarah Neumann, Frauke Liers
Publication date: 28 June 2024
Published in: Discrete Optimization (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- On shortest disjoint paths in planar graphs
- Optimal rectangle packing
- Non-cyclic train timetabling and comparability graphs
- Some no-wait shops scheduling problems: Complexity aspect
- The directed subgraph homeomorphism problem
- Staircase compatibility and its applications in scheduling and piecewise linearization
- Robust flows over time: models and complexity results
- Graph minors. XIII: The disjoint paths problem
- The clique problem with multiple-choice constraints under a cycle-free dependency graph
- Subdimensional expansion for multirobot path planning
- Direct routing: Algorithms and complexity
- Multicommodity flows over time: Efficient algorithms and complexity
- Structural Investigation of Piecewise Linearized Network Flow Problems
- An Introduction to Network Flows over Time
- Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
- Some new results in flow shop scheduling
- Packet Routing on the Grid
- On the Computational Complexity of Combinatorial Problems
- Fault-tolerant wormhole routing algorithms for mesh networks
- Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch
- The complexity of theorem-proving procedures
- An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization
This page was built for publication: The non-stop disjoint trajectories problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564192)
