Reachability in choice networks

DOI10.1016/J.DISOPT.2023.100761MaRDI QIDQ6108917zbMATH OpenOpenAlexFDO

Authors Piotr Wojciechowski, K. Subramani, Alvaro Velasquez

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

zbMATH Keywords

shortest pathslogisticsreachabilityNP-completechoice networks

Mathematics Subject Classification ID

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)

Recommendations

• Analyzing the reachability problem in choice networks
• The problems of selecting an optimal path on network
• scientific article; zbMATH DE number 1558116
• Publication:4726020
• Connectivity vs. reachability

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?)
• A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
• A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
• 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
• Exact exponential algorithms.
• 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
• Frontiers of Combining Systems
• 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 approximability of the maximum common subgraph problem
• On the complexity of approximating the independent set problem
• On the complexity of paths avoiding forbidden pairs
• Optimizing Military Airlift
• Parameterized algorithms
• Shortest-path algorithms: Taxonomy and annotation
• Some constrained shortest-route problems
• The Variance-Constrained Shortest Path Problem

Cited in

(3)

• scientific article; zbMATH DE number 1799527 (Why is no real title available?)
• A fresh look at free choice nets
• scientific article; zbMATH DE number 4215383 (Why is no real title available?)

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)