Reachability in choice networks
DOI10.1016/j.disopt.2023.100761zbMath1527.90245OpenAlexW4321506951MaRDI QIDQ6108917
Alvaro Velasquez, Piotr J. Wojciechowski, K. Subramani and Vahan Mkrtchyan
Publication date: 30 June 2023
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2023.100761
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Antistrong digraphs
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
- Exact exponential algorithms.
- On paths avoding forbidden pairs of vertices in a graph
- On the complexity of paths avoiding forbidden pairs
- On the complexity of approximating the independent set problem
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- 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
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
- Complexity of the path avoiding forbidden pairs problem revisited
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
- Finding Paths in Grids with Forbidden Transitions
- Shortest-path algorithms: Taxonomy and annotation
- Faster algorithms for the shortest path problem
- Optimizing Military Airlift
- 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
- On the approximability of the maximum common subgraph problem
- Frontiers of Combining Systems
- Parameterized Algorithms
- Some constrained shortest-route problems
This page was built for publication: Reachability in choice networks
