Ranking robustness and its application to evacuation planning

DOI10.1016/j.ejor.2016.05.037zbMath1375.90256OpenAlexW2268908655MaRDI QIDQ1681390

Horst W. Hamacher, Anika Kinscherff, Marc Goerigk

Publication date: 23 November 2017

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.05.037

zbMATH Keywords

combinatorial optimizationrobust optimizationevacuation planningsolution ranking

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (1)

COMPARING THE SMALL-SAMPLE ESTIMATION ERROR OF CONCEPTUALLY DIFFERENT RISK MEASURES

Uses Software

• NetworkX
• Gurobi
• NumPy
• igraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A bicriteria approach to robust optimization
• Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• On the robust shortest path problem.
• A new implementation of Yen's ranking loopless paths algorithm
• An exact algorithm for the robust shortest path problem with interval data
• Robustness analysis in decision aiding, optimization, and analytics
• Survey of methods to visualize alternatives in multiple criteria decision making problems
• Robust Convex Optimization
• Robust optimization in the presence of uncertainty
• Theory and Applications of Robust Optimization
• Lagrangean Decomposition for Mean-Variance Combinatorial Optimization
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: Ranking robustness and its application to evacuation planning