Optimal paths in probabilistic networks: A case with temporary preferences

DOI10.1016/0305-0548(85)90034-6zbMath0607.90086OpenAlexW1972886737MaRDI QIDQ1086176

Pitu B. Mirchandani, Hossein Soroush

Publication date: 1985

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(85)90034-6

zbMATH Keywords

quadratic utility functionshortest route problem in networkstemporary and permanent preferences

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items

Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network, Risk taking in stochastic PERT networks, Multiobjective routing of hazardous materials in stochastic networks, New reformulations of distributionally robust shortest path problem, Solving a stochastic single machine problem with initial idle time and quadratic objective, Least possible time paths in stochastic, time-varying networks., A new approach to determine the critical path in stochastic activity network, Optimal paths in bi-attribute networks with fractional cost functions, Maximum probability shortest path problem, Extended dominance and a stochastic shortest path problem, Dynamic journeying under uncertainty, Multicriteria adaptive paths in stochastic, time-varying networks, Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function, Distributionally robust maximum probability shortest path problem, Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Optimal paths in graphs with stochastic or multidimensional weights
• Shortest Paths in Probabilistic Graphs