Pages that link to "Item:Q4419276"

The following pages link to Dynamic shortest paths minimizing travel times and costs (Q4419276):

Displaying 27 items.

• A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
• Dynamic shortest path problems with time-varying costs (Q845562) (← links)
• An extension of labeling techniques for finding shortest path trees (Q1027584) (← links)
• A dynamic programming solution of a shortest path problem with time constraints on movement and parking (Q1191781) (← links)
• A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network (Q1197968) (← links)
• Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem (Q1617289) (← links)
• Minimization of travel time and weighted number of stops in a traffic-light network (Q1869410) (← links)
• Optimising waiting at nodes in time-dependent networks: cost functions and applications (Q1949565) (← links)
• Fast paths in large-scale dynamic road networks (Q2268926) (← links)
• Anytime search in dynamic graphs (Q2389673) (← links)
• Dynamic graph generation for the shortest path problem in time expanded networks (Q2436645) (← links)
• Algorithms for time-dependent bicriteria shortest path problems (Q2465939) (← links)
• Solving the \(k\)-shortest path problem with time windows in a time varying network (Q2517796) (← links)
• Computation of the optimal value function in time-dependent networks (Q2811299) (← links)
• The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks (Q2943828) (← links)
• Optimising material handling costs in an assembly workshop (Q3055375) (← links)
• (Q3193621) (← links)
• Dynamic minimum cost path problem with curfews (Q3402950) (← links)
• Minimum work paths in elevated networks (Q3528153) (← links)
• Shortest paths on dynamic graphs (Q3638853) (← links)
• Minimum weight paths in time-dependent networks (Q3971577) (← links)
• (Q4356887) (← links)
• Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights (Q4408702) (← links)
• Cheapest paths in dynamic networks (Q4565769) (← links)
• Commuters' Paths with Penalties for Early or Late Arrival Time (Q5202523) (← links)
• Algorithms – ESA 2004 (Q5464616) (← links)
• A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits (Q6087122) (← links)