Analyzing the reachability problem in choice networks
From MaRDI portal
Publication:2170221
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 751135 (Why is no real title available?)
- An algorithm for the resource constrained shortest path problem
- An efficient exact approach for the constrained shortest path tour problem
- Antistrong digraphs
- Complexity of the path avoiding forbidden pairs problem revisited
- Faster algorithms for the shortest path problem
- Finding paths in graphs avoiding forbidden transitions
- Finding paths in grids with forbidden transitions
- Finding read-once resolution refutations in systems of 2CNF clauses
- Graph-Theoretic Concepts in Computer Science
- Joint chance constrained shortest path problem with Copula theory
- Multi-criteria approximation schemes for the resource constrained shortest path problem
- Network flows. Theory, algorithms, and applications.
- On finding shortest paths in arc-dependent networks
- On paths avoding forbidden pairs of vertices in a graph
- On the complexity of paths avoiding forbidden pairs
- Parameterized algorithms
- Shortest-path algorithms: Taxonomy and annotation
- Some constrained shortest-route problems
- The Variance-Constrained Shortest Path Problem
This page was built for publication: Analyzing the reachability problem in choice networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170221)