Pages that link to "Item:Q3040947"

The following pages link to Optimal paths in graphs with stochastic or multidimensional weights (Q3040947):

Displaying 38 items.

• Optimal path problems with second-order stochastic dominance constraints (Q264233) (← links)
• Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
• hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem (Q336313) (← links)
• Shortest path problem with uncertain arc lengths (Q660922) (← links)
• Uncertain random shortest path problem (Q781302) (← links)
• Optimal routing for maximizing the travel time reliability (Q862490) (← links)
• New models for shortest path problem with fuzzy arc lengths (Q924789) (← links)
• Extended dominance and a stochastic shortest path problem (Q954058) (← links)
• A stochastic dynamic traveling salesman problem with hard time windows (Q1042055) (← links)
• Optimal paths in probabilistic networks: A case with temporary preferences (Q1086176) (← links)
• Probabilistic shortest path problems with budgetary constraints (Q1113810) (← links)
• Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function (Q1280137) (← links)
• Multicriteria heuristic search. (Q1405227) (← links)
• Least possible time paths in stochastic, time-varying networks. (Q1406727) (← links)
• Arrival time dependent routing policies in public transport (Q1627847) (← links)
• A new approach to determine the critical path in stochastic activity network (Q1718645) (← links)
• Itinerary planning with time budget for risk-averse travelers (Q1754240) (← links)
• A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks (Q1806861) (← links)
• An empirical investigation of some bicriterion shortest path algorithms (Q1823874) (← links)
• Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks (Q1869511) (← links)
• Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights (Q2108190) (← links)
• Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks (Q2183323) (← links)
• Shortest path network problems with stochastic arc weights (Q2230798) (← links)
• Dynamic journeying under uncertainty (Q2253524) (← links)
• Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering (Q2364368) (← links)
• Shortest paths in stochastic networks with correlated link costs (Q2387385) (← links)
• Algorithms for non-linear and stochastic resource constrained shortest path (Q2417959) (← links)
• Multicriteria adaptive paths in stochastic, time-varying networks (Q2491770) (← links)
• Arriving on time (Q2499355) (← links)
• Models and algorithm for stochastic shortest path problem (Q2572036) (← links)
• Additive Consistency of Risk Measures and Its Application to Risk-Averse Routing in Networks (Q2833115) (← links)
• A mean-variance model for the minimum cost flow problem with stochastic arc costs (Q3057183) (← links)
• The most likely path on series-parallel networks (Q3113510) (← links)
• Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
• INEQUALITIES FOR CORRELATED BIVARIATE NORMAL DISTRIBUTION FUNCTION (Q4929142) (← links)
• Robust Adaptive Routing Under Uncertainty (Q4969320) (← links)
• Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) (← links)