A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem
DOI10.1002/net.22253MaRDI QIDQ6663968
Cristina Bazgan, Johannes Kager, Clemens Thielen, Daniel Vanderpooten
Publication date: 15 January 2025
Published in: Networks (Search for Journal in Brave)
multi-objective optimizationshortest pathstractabilityalgorithm analysislabel-setting algorithmtemporal graphs
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding temporal paths under waiting time constraints
- On the enumeration of bicriteria temporal paths
- On the expressivity of time-varying graphs
- Algorithms for time-dependent bicriteria shortest path problems
- On computing Pareto optimal paths in weighted time-dependent networks
- Deleting edges to restrict the size of an epidemic in temporal networks
- Efficient models for timetable information in public transportation systems
- Minimum Convex Cost Dynamic Network Flows
- Algorithms for minimum-cost paths in time-dependent networks with waiting policies
- How adherence to public health measures shapes epidemic spreading: A temporal network model
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Temporal Network Theory
- Multicriteria Optimization
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
This page was built for publication: A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663968)
