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

DOI10.1007/S10479-016-2244-YMaRDI QIDQ513625zbMATHOpenAlexWikidataFDO

Authors Zhouchun Huang, Eduardo L. Pasiliao, Daniel Simmons, Qipeng P. 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

shortest path problemtraveling salesman problemcompact formulationbenders decompositionarc failuresreliable routing

Mathematics Subject Classification ID

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

Recommendations

• Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
• Mathematical programming algorithms for two-path routing problems with reliability considerations
• The \(\alpha\)-reliable shortest path problem
• Chance-constrained multi-terminal network design problems
• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems

Cites work

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

Cited in

(5)

• Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs
• Vulnerability analysis of interdependent network via integer programming approaches
• A cutting plane method for risk-constrained traveling salesman problem with random arc costs
• Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
• Mathematical programming algorithms for two-path routing problems with reliability considerations

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

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