The traveling salesman problem with backhauls
type: Item
instance of: scholarly article
title: The traveling salesman problem with backhauls
zbMATH Open document ID: 0847.90135
DOI: 10.1016/0305-0548(95)00036-4
author: Michel Gendreau
author: Alain Hertz
author: G. Laporte
published in: Computers \& Operations Research
publication date: 1996-07-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 895072
zbMATH Keywords: heuristics
zbMATH Keywords: traveling salesman
zbMATH Keywords: least cost Hamiltonian tour
MaRDI profile type: Publication
full work available at URL: 0305-0548(95)00036-4
OpenAlex ID: W2125375576
cites work: Procedures for travelling salesman problems with additional constraints
cites work: The symmetric clustered traveling salesman problem
cites work: An algorithm for the traveling salesman problem with pickup and delivery customers
cites work: Q4039765
cites work: The vehicle routing problem with backhauls
cites work: A new branching strategy for time constrained routing problems with application to backhauling
cites work: An Algorithm for the Traveling Salesman Problem
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
cites work: Q3720323
cites work: Q4145160
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Q3686500
cites work: Q3693257
Recommended article: The traveling salesman problem with delivery and backhauls
Recommended article: An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
Recommended article: The multiple traveling salesman problem with backup coverage
Recommended article: Q4845366
Recommended article: The Traveling-Salesman Problem
Recommended article: Traveling salesman problem
Recommended article: On the solution of traveling salesman problems
Recommended article: Q3059314
description: scientific article; zbMATH DE number 895072