Pages that link to "Item:Q4342759"

The following pages link to Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées (Q4342759):

Displaying 19 items.

• Time-dependent routing problems: a review (Q342083) (← links)
• Exact approaches for integrated aircraft fleeting and routing at TunisAir (Q540645) (← links)
• Point-to-point shortest paths on dynamic time-dependent road networks (Q607878) (← links)
• A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
• A way to optimally solve a time-dependent vehicle routing problem with time windows (Q1002083) (← links)
• A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
• A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem (Q1626744) (← links)
• Shortest path problems with left-side time windows (Q1926637) (← links)
• Shortest paths in a network with time-dependent flow speeds (Q1969888) (← links)
• Algorithms for time-dependent bicriteria shortest path problems (Q2465939) (← links)
• CP methods for scheduling and routing with~time-dependent task costs (Q2513747) (← links)
• Solving the \(k\)-shortest path problem with time windows in a time varying network (Q2517796) (← links)
• Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem (Q2581622) (← links)
• On path ranking in time-dependent graphs (Q2669544) (← links)
• The multi-period \(p\)-center problem with time-dependent travel times (Q2669591) (← links)
• Engineering time-dependent many-to-many shortest paths computation (Q2917289) (← links)
• Theory and application of reciprocal transformation of “path problem” and “time float problem” (Q2969956) (← links)
• Design and Optimization of Dynamic Routing Problems with Time Dependent Travel Times (Q5392064) (← links)
• The time-dependent shortest path and vehicle routing problem (Q5889200) (← links)