Solving a generalized traveling salesperson problem with stochastic customers
From MaRDI portal
Publication:868135
DOI10.1016/j.cor.2005.06.022zbMath1112.90072OpenAlexW1996444471MaRDI QIDQ868135
Hao Tang, Elise D. Miller-Hooks
Publication date: 19 February 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.06.022
Related Items (3)
The probabilistic orienteering problem ⋮ The traveling purchaser problem with stochastic prices: exact and approximate algorithms ⋮ Adaptive demand peak management in online transport process planning
Cites Work
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- Further results on the probabilistic traveling salesman problem
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- The Vehicle Routing Problem with Stochastic Travel Times
- On general routing problems
- Exact Solution to a Location Problem with Stochastic Demands
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- Some Applications of the Generalized Travelling Salesman Problem
- The Covering Tour Problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Exact solution of the generalized routing problem through graph transformations
- Efficient Algorithms for Solving the Shortest Covering Path Problem
- The symmetric generalized traveling salesman polytope
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Priori Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving a generalized traveling salesperson problem with stochastic customers
