Pages that link to "Item:Q1406645"

The following pages link to On the robust shortest path problem. (Q1406645):

Displaying 50 items.

• Optimal path problems with second-order stochastic dominance constraints (Q264233) (← links)
• The minmax regret robust shortest path problem in a finite multi-scenario model (Q279255) (← links)
• Minmax robustness for multi-objective optimization problems (Q297049) (← links)
• Robust optimization for routing problems on trees (Q301384) (← links)
• New reformulations of distributionally robust shortest path problem (Q342487) (← links)
• New models for the robust shortest path problem: complexity, resolution and generalization (Q367636) (← links)
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
• Risk-control approach for bottleneck transportation problem with randomness and fuzziness (Q475802) (← links)
• Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291) (← links)
• An \(s\)-\(t\) connection problem with adaptability (Q534328) (← links)
• Scheduling with uncertainties on new computing platforms (Q535305) (← links)
• The computational complexity of the relative robust shortest path problem with interval data (Q596264) (← links)
• A preference-based approach to spanning trees and shortest paths problems (Q704097) (← links)
• A relaxation algorithm with a probabilistic guarantee for robust deviation optimization (Q707779) (← links)
• Complexity of the min-max and min-max regret assignment problems (Q813974) (← links)
• A new model for path planning with interval data (Q1000974) (← links)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
• Choosing robust solutions in discrete optimization problems with fuzzy costs (Q1037888) (← links)
• Robustness in operational research and decision aiding: a multi-faceted issue (Q1044079) (← links)
• A branch and bound algorithm for the robust shortest path problem with interval data. (Q1426725) (← links)
• Algorithms and uncertainty sets for data-driven robust shortest path problems (Q1634306) (← links)
• Shortest paths with shortest detours. A biobjective routing problem (Q1673931) (← links)
• Ranking robustness and its application to evacuation planning (Q1681390) (← links)
• Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883) (← links)
• Complexity of strict robust integer minimum cost flow problems: an overview and further results (Q1725614) (← links)
• Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios (Q1751178) (← links)
• Itinerary planning with time budget for risk-averse travelers (Q1754240) (← links)
• An exact algorithm for the robust shortest path problem with interval data (Q1885969) (← links)
• Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria (Q1926791) (← links)
• Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← links)
• Distributionally robust maximum probability shortest path problem (Q2075464) (← links)
• Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
• Shortest path network problems with stochastic arc weights (Q2230798) (← links)
• Minimizing maximum risk for fair network connection with interval data (Q2267272) (← links)
• A randomized algorithm for the min-Max selecting items problem with uncertain weights (Q2267304) (← links)
• Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients (Q2282559) (← links)
• Wasserstein distributionally robust shortest path problem (Q2301929) (← links)
• A decision-theoretic approach to robust optimization in multivalued graphs (Q2379879) (← links)
• A Benders decomposition approach for the robust spanning tree problem with interval data (Q2503220) (← links)
• Bulk-robust combinatorial optimization (Q2515045) (← links)
• The robust shortest path problem in series -- parallel multidigraphs with interval data (Q2583712) (← links)
• Choquet-based optimisation in multiobjective shortest path and spanning tree problems (Q2655619) (← links)
• An approach to the distributionally robust shortest path problem (Q2668652) (← links)
• Fuzzy and robust approach for decision-making in disaster situations (Q2673288) (← links)
• Recoverable robust shortest path problems (Q2892155) (← links)
• The most likely path on series-parallel networks (Q3113510) (← links)
• Robust shortest path planning and semicontractive dynamic programming (Q3120605) (← links)
• Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs (Q3455883) (← links)
• An enhanced exact procedure for the absolute robust shortest path problem (Q3563623) (← links)
• Optimization under Decision-Dependent Uncertainty (Q4571878) (← links)