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.
- Route planning with turn restrictions: A computational experiment (Q1758274) (← links)
- Finding the \(K\) shortest paths in a schedule-based transit network (Q1761096) (← links)
- The inventory-routing problem with transshipment (Q1761192) (← links)
- A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation (Q1761961) (← links)
- Vehicle routing under time-dependent travel times: the impact of congestion avoidance (Q1762059) (← links)
- Service and capacity allocation in \(M/G/c/c\) state-dependent queueing networks (Q1764766) (← links)
- Location analysis: a synthesis and survey (Q1776950) (← links)
- Route and speed optimization for autonomous trucks (Q1782162) (← links)
- Directionality of real world networks as predicted by path length in directed and undirected graphs (Q1782671) (← links)
- Parallel redistancing using the Hopf-Lax formula (Q1783414) (← links)
- Closest paths in graph drawings under an elastic metric (Q1784072) (← links)
- An algebraic framework for minimum spanning tree problems (Q1786562) (← links)
- Global disease spread: statistics and estimation of arrival times (Q1788678) (← links)
- Least expected time paths in stochastic schedule-based transit networks (Q1793543) (← links)
- Optimization of the distribution and localization of wireless sensor networks based on differential evolution approach (Q1793597) (← links)
- Fast asymmetric fronts propagation for image segmentation (Q1799533) (← links)
- Nilpotent approximations of sub-Riemannian distances for fast perceptual grouping of blood vessels in 2D and 3D (Q1799539) (← links)
- Path-value functions for which Dijkstra's algorithm returns optimal mapping (Q1799581) (← links)
- Metric regression forests for correspondence estimation (Q1799955) (← links)
- Some concepts of stability analysis in combinatorial optimization (Q1805456) (← links)
- The minimum spanning tree problem on a planar graph (Q1805468) (← links)
- Genetic algorithm approach on multi-criteria minimum spanning tree problem (Q1809832) (← links)
- Cost allocation in spanning network enterprises with stochastic connection costs. (Q1811556) (← links)
- A lower bound for the shortest Hamiltonean path in directed graphs (Q1814249) (← links)
- A bidirectional shortest-path algorithm with good average-case behavior (Q1823692) (← links)
- Characterizing the shortest path of an object among obstacles (Q1823707) (← links)
- Solving combinatorial problems with combined min-max-min-sum objective and applications (Q1824562) (← links)
- New lower bounds for the symmetric travelling salesman problem (Q1824572) (← links)
- Two routing problems with the limitation of fuel (Q1838427) (← links)
- Alternating paths in edge-colored complete graphs (Q1842658) (← links)
- A penalty function heuristic for the resource constrained shortest path problem (Q1848355) (← links)
- Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
- Percolation in dense storage arrays (Q1850367) (← links)
- An external memory data structure for shortest path queries (Q1861568) (← links)
- Theory of 2-3 heaps (Q1861570) (← links)
- Improved approximation algorithms for multilevel facility location problems (Q1866994) (← links)
- Minimization of travel time and weighted number of stops in a traffic-light network (Q1869410) (← links)
- Hospital lift system simulator: A performance evaluator-predictor (Q1869519) (← links)
- Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks (Q1869688) (← links)
- Transport and diffusion of material quantities on propagating interfaces via level set methods. (Q1873371) (← links)
- A new approach to all-pairs shortest paths on real-weighted graphs (Q1884872) (← links)
- Graph traversal and graph transformation (Q1885899) (← links)
- Shortest route computation in distributed systems (Q1885965) (← links)
- An exact algorithm for the robust shortest path problem with interval data (Q1885969) (← links)
- An algorithm for ranking quickest simple paths (Q1886854) (← links)
- Approximation algorithms for the optimal \(p\)-source communication spanning tree (Q1887037) (← links)
- An improved algorithm for the \(k\)-source maximum eccentricity spanning trees (Q1887071) (← links)
- All-pairs shortest paths and the essential subgraph (Q1894298) (← links)
- On the integral 4-packing of \(T\)-cuts (Q1896345) (← links)
- Robust vehicle routing DSS and road networks on a European scale? (Q1897423) (← links)
