Optimal paths in graphs with stochastic or multidimensional weights

DOI10.1145/358172.358406MaRDI QIDQ3040947zbMATH OpenOpenAlexFDO

Authors Ronald P. Loui

Publication date 1983

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1802/9359

zbMATH Keywords

approximation techniquesoptimal pathshortest path problemsolution algorithmstochastic weights

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited in

(41)

• A stochastic dynamic traveling salesman problem with hard time windows
• Optimal paths in probabilistic networks: A case with temporary preferences
• Probabilistic shortest path problems with budgetary constraints
• Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
• Multicriteria heuristic search.
• Least possible time paths in stochastic, time-varying networks.
• Arrival time dependent routing policies in public transport
• A new approach to determine the critical path in stochastic activity network
• Itinerary planning with time budget for risk-averse travelers
• A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
• An empirical investigation of some bicriterion shortest path algorithms
• Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
• Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights
• Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks
• Shortest path network problems with stochastic arc weights
• Dynamic journeying under uncertainty
• Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
• Shortest paths in stochastic networks with correlated link costs
• Algorithms for non-linear and stochastic resource constrained shortest path
• Multicriteria adaptive paths in stochastic, time-varying networks
• Arriving on time
• Models and algorithm for stochastic shortest path problem
• Optimal path problems with second-order stochastic dominance constraints
• Additive consistency of risk measures and its application to risk-averse routing in networks
• Approximation algorithms for stochastic combinatorial optimization problems
• A mean-variance model for the minimum cost flow problem with stochastic arc costs
• The most likely path on series-parallel networks
• hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• INEQUALITIES FOR CORRELATED BIVARIATE NORMAL DISTRIBUTION FUNCTION
• Robust adaptive routing under uncertainty
• Maximizing expected utility for stochastic combinatorial optimization problems
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
• Shortest path problem with uncertain arc lengths
• Road traffic estimation and algorithmic routing in a spatially dependent network
• Road traffic estimation and distribution-based route selection
• EMOA^*: a framework for search-based multi-objective path planning
• Uncertain random shortest path problem
• Optimal routing for maximizing the travel time reliability
• New models for shortest path problem with fuzzy arc lengths
• Extended dominance and a stochastic shortest path problem

This page was built for publication: Optimal paths in graphs with stochastic or multidimensional weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3040947)