Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs
From MaRDI portal
Publication:895762
DOI10.1007/s11590-014-0798-7zbMath1335.90082OpenAlexW2038659272WikidataQ57734112 ScholiaQ57734112MaRDI QIDQ895762
Zhouchun Huang, Qipeng Phil Zheng
Publication date: 4 December 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0798-7
Related Items (2)
Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem ⋮ Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
Cites Work
- A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
- Robust optimization of graph partitioning involving interval uncertainty
- Stochastic and risk management models and solution algorithm for natural gas transmission network expansion and LNG terminal location planning
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
- Polynomial-time identification of robust network flows under uncertain arc failures
- On the solutions of stochastic traveling salesman problems
- Heuristics for routing heterogeneous unmanned vehicles with fuel constraints
- The sample average approximation method applied to stochastic routing problems: a computational study
- A Dynamic Traveling Salesman Problem with Stochastic Arc Costs
- A mean-variance model for the minimum cost flow problem with stochastic arc costs
- A Random Keys Based Genetic Algorithm for the Target Visitation Problem
- A concise guide to the Traveling Salesman Problem
- Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results
- A Vehicle Routing Problem with Stochastic Demand
This page was built for publication: Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs
