Reachability in choice networks
DOI10.1016/J.DISOPT.2023.100761zbMATH Open1527.90245OpenAlexW4321506951MaRDI QIDQ6108917FDOQ6108917
Alvaro Velasquez, Piotr Wojciechowski, K. Subramani
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) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact exponential algorithms.
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- The Variance-Constrained Shortest Path Problem
- Parameterized Algorithms
- Faster algorithms for the shortest path problem
- On the complexity of approximating the independent set problem
- On the approximability of the maximum common subgraph problem
- Finding paths in graphs avoiding forbidden transitions
- Complexity of the path avoiding forbidden pairs problem revisited
- Shortest-path algorithms: Taxonomy and annotation
- An algorithm for the resource constrained shortest path problem
- On paths avoding forbidden pairs of vertices in a graph
- On the complexity of paths avoiding forbidden pairs
- Multi-criteria approximation schemes for the resource constrained shortest path problem
- Antistrong digraphs
- Frontiers of Combining Systems
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
- On finding shortest paths in arc-dependent networks
- Optimizing Military Airlift
- Joint chance constrained shortest path problem with Copula theory
- An efficient exact approach for the constrained shortest path tour problem
- Finding Paths in Grids with Forbidden Transitions
- Finding read-once resolution refutations in systems of 2CNF clauses
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
- Some constrained shortest-route problems
Cited In (3)
This page was built for publication: Reachability in choice networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6108917)
