Solving a generalized traveling salesperson problem with stochastic customers
type: Item
instance of: scholarly article
title: Solving a generalized traveling salesperson problem with stochastic customers
zbMATH Open document ID: 1112.90072
author: Hao Tang
author: Elise Miller-Hooks
published in: Computers \& Operations Research
publication date: 2007-02-19T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5128188
zbMATH Keywords: traveling salesman
zbMATH Keywords: stochastic routing
zbMATH Keywords: probabilistic TSP
zbMATH Keywords: generalized TSP
MaRDI profile type: Publication
full work available at URL: j.cor.2005.06.022
OpenAlex ID: W1996444471
cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
cites work: Efficient Algorithms for Solving the Shortest Covering Path Problem
cites work: Some Applications of the Generalized Travelling Salesman Problem
cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse
cites work: Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
cites work: The symmetric generalized traveling salesman polytope
cites work: Q3787809
cites work: A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
cites work: Q3790960
cites work: Further results on the probabilistic traveling salesman problem
cites work: A Priori Optimization of the Probabilistic Traveling Salesman Problem
cites work: A Priori Optimization
cites work: Q3799802
cites work: The Vehicle Routing Problem with Stochastic Travel Times
cites work: Exact Solution to a Location Problem with Stochastic Demands
cites work: An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
cites work: The Covering Tour Problem
cites work: Q3720323
cites work: Exact solution of the generalized routing problem through graph transformations
cites work: On general routing problems
cites work: Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
DOI: 10.1016/J.COR.2005.06.022
description: scientific article; zbMATH DE number 5128188