Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios

DOI10.1007/s10479-016-2244-yzbMath1357.90121OpenAlexW2419430748WikidataQ57734077 ScholiaQ57734077MaRDI QIDQ513625

Eduardo L. Pasiliao, Zhouchun Huang, Daniel Simmons, Qipeng Phil Zheng

Publication date: 7 March 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-016-2244-y

zbMATH Keywords

traveling salesman problemshortest path problemcompact formulationbenders decompositionarc failuresreliable routing

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Combinatorial optimization (90C27)

Related Items (2)

Vulnerability analysis of interdependent network via integer programming approaches ⋮ A cutting plane method for risk-constrained traveling salesman problem with random arc costs

Cites Work

• Unnamed Item
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Polynomial-time identification of robust network flows under uncertain arc failures
• Probabilistic shortest path problems with budgetary constraints
• The sample average approximation method applied to stochastic routing problems: a computational study
• An exact approach for solving integer problems under probabilistic constraints with random technology matrix
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Shortest paths in stochastic networks with correlated link costs
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• A concise guide to the Traveling Salesman Problem
• The Probabilistic Set-Covering Problem
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• The Traveling Salesman Location Problem on Stochastic Networks
• The Stochastic Shortest Route Problem
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• Stochastic shortest path problems with recourse
• Probabilistic Set Covering with Correlations

This page was built for publication: Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios