Pages that link to "Item:Q78129"
From MaRDI portal
The following pages link to A note on two problems in connexion with graphs (Q78129):
Displaying 50 items.
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem (Q5084630) (← links)
- On the Exact Solution of Prize-Collecting Steiner Tree Problems (Q5085996) (← links)
- Faster Algorithms for All Pairs Non-Decreasing Paths Problem (Q5091202) (← links)
- (Q5092396) (← links)
- Path Counting for Grid-Based Navigation (Q5094043) (← links)
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances (Q5106421) (← links)
- Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles (Q5111696) (← links)
- Control-Theoretic Models of Environmental Crime (Q5113810) (← links)
- A Model for Optimal Human Navigation with Stochastic Effects (Q5117979) (← links)
- On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows (Q5124004) (← links)
- Ship Traffic Optimization for the Kiel Canal (Q5126634) (← links)
- Transition scale-spaces: A computational theory for the discretized entorhinal cortex (Q5131177) (← links)
- From Bellman to Dijkstra: Set-Oriented Construction of Globally Optimal Controllers (Q5131684) (← links)
- Filtering Multi-set Tree: Data Structure for Flexible Matching Using Multi-track Data (Q5135244) (← links)
- Distributed shortest-path protocols for time-dependent networks (Q5137327) (← links)
- Exact Approaches for Network Design Problems with Relays (Q5137444) (← links)
- Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming (Q5140029) (← links)
- (Q5150562) (← links)
- (Q5150665) (← links)
- The first open channel for yield-stress fluids in porous media (Q5150851) (← links)
- (Q5154534) (← links)
- The idemetric property: when most distances are (almost) the same (Q5160620) (← links)
- From the physics of interacting polymers to optimizing routes on the London Underground (Q5170973) (← links)
- Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey (Q5175773) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics (Q5214308) (← links)
- Inverse Optimal Transport (Q5217710) (← links)
- How to Calculate the Barycenter of a Weighted Graph (Q5219691) (← links)
- New presentations of a link and virtual link (Q5223426) (← links)
- A Phase-field Approximation of the Perimeter under a Connectedness Constraint (Q5234598) (← links)
- First arrival traveltime tomography using supervised descent learning technique (Q5236683) (← links)
- An Easily Implemented, Block-Based Fast Marching Method with Superior Sequential and Parallel Performance (Q5238749) (← links)
- Vulnerability of weighted networks (Q5239286) (← links)
- (Q5240196) (← links)
- Digital Traveler Assistant (Q5245435) (← links)
- DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS (Q5249002) (← links)
- Optimal Control with Budget Constraints and Resets (Q5252497) (← links)
- <i>N</i>-gram distribution and unification gain problem and its optimal solution (Q5252925) (← links)
- A Forward-Backward Single-Source Shortest Paths Algorithm (Q5255013) (← links)
- A Hybrid Metaheuristic for Routing on Multicast Networks (Q5265221) (← links)
- Customizable Contraction Hierarchies (Q5266613) (← links)
- Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds (Q5283371) (← links)
- INVESTIGATION OF DYNAMICAL SYSTEMS USING SYMBOLIC IMAGES: EFFICIENT IMPLEMENTATION AND APPLICATIONS (Q5297804) (← links)
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes (Q5302069) (← links)
- CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS (Q5325617) (← links)
- Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems (Q5326795) (← links)
- On Some Special Network Flow Problems: The Shortest Path Tour Problems (Q5326892) (← links)
- Examining <i>k</i>-nearest neighbour networks: Superfamily phenomena and inversion (Q5347069) (← links)
- Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance (Q5364201) (← links)
- Optimizing in Graphs with Expensive Computation of Edge Weights (Q5391961) (← links)