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

DOI10.1007/S10479-016-2244-YzbMATH Open1357.90121OpenAlexW2419430748WikidataQ57734077 ScholiaQ57734077MaRDI QIDQ513625FDOQ513625

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

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

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)

Cites Work

• Network flows. Theory, algorithms, and applications.
• A concise guide to the Traveling Salesman Problem
• Stochastic shortest path problems with recourse
• The sample average approximation method applied to stochastic routing problems: a computational study
• The Probabilistic Set-Covering Problem
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Probabilistic set covering with correlations
• 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 Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• The Stochastic Shortest Route Problem
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• Polynomial-time identification of robust network flows under uncertain arc failures
• Probabilistic shortest path problems with budgetary constraints
• The Traveling Salesman Location Problem on Stochastic Networks

Cited In (4)

• Vulnerability analysis of interdependent network via integer programming approaches
• Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
• A cutting plane method for risk-constrained traveling salesman problem with random arc costs
• 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)