Analyzing the reachability problem in choice networks

DOI10.1007/978-3-031-08011-1_27zbMath1504.90178OpenAlexW4285179582MaRDI QIDQ2170221

Alvaro Velasquez, K. Subramani and Vahan Mkrtchyan, Piotr J. Wojciechowski

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08011-1_27

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Antistrong digraphs
• On paths avoding forbidden pairs of vertices in a graph
• On the complexity of paths avoiding forbidden pairs
• Finding read-once resolution refutations in systems of 2CNF clauses
• Multi-criteria approximation schemes for the resource constrained shortest path problem
• Finding paths in graphs avoiding forbidden transitions
• Joint chance constrained shortest path problem with Copula theory
• On finding shortest paths in arc-dependent networks
• Complexity of the path avoiding forbidden pairs problem revisited
• Finding Paths in Grids with Forbidden Transitions
• Shortest-path algorithms: Taxonomy and annotation
• Faster algorithms for the shortest path problem
• An algorithm for the resource constrained shortest path problem
• The Variance-Constrained Shortest Path Problem
• An efficient exact approach for the constrained shortest path tour problem
• Parameterized Algorithms
• Some constrained shortest-route problems
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Analyzing the reachability problem in choice networks