A new model for path planning with interval data

DOI10.1016/J.COR.2008.06.002MaRDI QIDQ1000974zbMATH OpenOpenAlexFDO

Authors Jie Hu, Xujin Chen, Xiaodong Hu

Publication date 12 February 2009

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

Full work available at URL https://doi.org/10.1016/j.cor.2008.06.002

zbMATH Keywords

interval datapath planningminimum risk-sum

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On the Minimum Risk-Sum Path Problem
• A polynomial solvable minimum risk spanning tree problem with interval data
• Dynamic programming and minimum risk paths
• Minimizing maximum risk for fair network connection with interval data
• The quickest path problem with interval lead times

Cites work

• A branch and bound algorithm for the robust shortest path problem with interval data.
• Approximation Schemes for the Restricted Shortest Path Problem
• Arriving on time
• Least expected time paths in stochastic, time-varying transportation networks
• On the online shortest path problem with limited arc cost dependencies
• On the robust shortest path problem.
• Robust discrete optimization and its applications
• Shortest Paths in Probabilistic Graphs
• The computational complexity of the relative robust shortest path problem with interval data
• The shortest path problem with two objective functions
• The shortest route problem with constraints

Cited in

(9)

• Min-max controllable risk problems
• On the Minimum Risk-Sum Path Problem
• Min‐sum controllable risk problems with concave risk functions of the same value range
• Deterministic risk control for cost-effective network connections
• Path planning using intervals and graphs
• Dynamic shortest path problems: hybrid routing policies considering network disruptions
• Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients
• Exact approaches for solving robust prize-collecting Steiner tree problems
• Reliably Safe Path Planning Using Interval Analysis

This page was built for publication: A new model for path planning with interval data

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