Multicriteria movement synchronization scheduling problems and algorithms
From MaRDI portal
Publication:3165912
DOI10.1080/02331934.2011.616895zbMath1254.90077OpenAlexW2008136073MaRDI QIDQ3165912
Publication date: 19 October 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.616895
approximation algorithmscomputational complexity analysistransport optimizationCGF systemsmovement planning and synchronizationnode--disjoint paths
Analysis of algorithms and problem complexity (68Q25) Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Paths and cycles (05C38)
Cites Work
- Unnamed Item
- The complexity of finding two disjoint paths with min-max objective function
- A quick method for finding shortest pairs of disjoint paths
- Disjoint Paths in a Planar Graph—A General Theorem
- Finding disjoint paths with different path-costs: Complexity and algorithms
- Disjoint paths in a network
- On the Complexity of Timetable and Multicommodity Flow Problems
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- Finding the k Shortest Paths
- The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
- Finding Disjoint Routes in Telecommunications Networks with Two Technologies
- Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout
- Algorithms for Obtaining Shortest Paths Visiting Specified Nodes