On the robust shortest path problem.
From MaRDI portal
Publication:1406645
DOI10.1016/S0305-0548(97)00085-3zbMath1040.90554MaRDI QIDQ1406645
Publication date: 7 September 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Related Items
Optimal path problems with second-order stochastic dominance constraints, The minmax regret robust shortest path problem in a finite multi-scenario model, Recoverable robust shortest path problems, An exact algorithm for the robust shortest path problem with interval data, Minmax robustness for multi-objective optimization problems, Robust optimization for routing problems on trees, Algorithms and uncertainty sets for data-driven robust shortest path problems, Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs, A decision-theoretic approach to robust optimization in multivalued graphs, Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty, New reformulations of distributionally robust shortest path problem, Choquet-based optimisation in multiobjective shortest path and spanning tree problems, The computational complexity of the relative robust shortest path problem with interval data, Optimization under Decision-Dependent Uncertainty, New models for the robust shortest path problem: complexity, resolution and generalization, Min‐Max quickest path problems, Shortest paths with shortest detours. A biobjective routing problem, An approach to the distributionally robust shortest path problem, Unnamed Item, Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria, Ranking robustness and its application to evacuation planning, Fuzzy and robust approach for decision-making in disaster situations, Min-max and min-max (relative) regret approaches to representatives selection problem, On modelling and solving the shortest path problem with evidential weights, Algorithms for the minmax regret path problem with interval data, Optimization problems with evidential linear objective, Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets, Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints, Approximating a two-machine flow shop scheduling under discrete scenario uncertainty, A branch and bound algorithm for the robust shortest path problem with interval data., Complexity of strict robust integer minimum cost flow problems: an overview and further results, Risk-control approach for bottleneck transportation problem with randomness and fuzziness, Combinatorial optimization problems with uncertain costs and the OWA criterion, Shortest path network problems with stochastic arc weights, An enhanced exact procedure for the absolute robust shortest path problem, Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios, Itinerary planning with time budget for risk-averse travelers, An \(s\)-\(t\) connection problem with adaptability, Scheduling with uncertainties on new computing platforms, A preference-based approach to spanning trees and shortest paths problems, A relaxation algorithm with a probabilistic guarantee for robust deviation optimization, Minimizing maximum risk for fair network connection with interval data, A randomized algorithm for the min-Max selecting items problem with uncertain weights, A Benders decomposition approach for the robust spanning tree problem with interval data, Extensions of labeling algorithms for multi‐objective uncertain shortest path problems, Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients, A new model for path planning with interval data, Bulk-robust combinatorial optimization, Min-max and min-max regret versions of combinatorial optimization problems: A survey, Wasserstein distributionally robust shortest path problem, Distributionally robust maximum probability shortest path problem, Choosing robust solutions in discrete optimization problems with fuzzy costs, The most likely path on series-parallel networks, Robustness in operational research and decision aiding: a multi-faceted issue, Robust shortest path planning and semicontractive dynamic programming, The Constrained Reliable Shortest Path Problem in Stochastic Time-Dependent Networks, The robust shortest path problem in series -- parallel multidigraphs with interval data, Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback, Parametric Shortest-Path Algorithms via Tropical Geometry, Complexity of the min-max and min-max regret assignment problems
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Inexact linear programming with generalized technological matrix sets
- Inexact linear programming with generalized resource sets
- Robust decisions in economic models
- Surrogate Constraint Duality in Mathematical Programming
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
