Heuristics for the traveling purchaser problem
type: Item
instance of: scholarly article
title: Heuristics for the traveling purchaser problem
zbMATH Open document ID: 1026.90016
DOI: 10.1016/S0305-0548(02)00020-5
author: Fayez F. Boctor
author: G. Laporte
author: Jacques Renaud
published in: Computers \& Operations Research
publication date: 2003-05-14T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1910176
zbMATH Keywords: routing
zbMATH Keywords: traveling purchaser problem
zbMATH Keywords: perturbation heuristics
MaRDI profile type: Publication
cites work: Travelling purchaser problem
cites work: A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
cites work: A branch and bound algorithm for the traveling purchaser problem
cites work: Sequencing many jobs on a multi-purpose facility
cites work: An efficient composite heuristic for the symmetric generalized traveling salesman problem
cites work: Approximate algorithms for the travelling purchaser problem
cites work: Improved solutions for the traveling purchaser problem.
cites work: Dynamic tabu search strategies for the traveling purchaser problem
cites work: An approximation algorithm for the TSP
cites work: A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
cites work: Genetic Algorithms-a Tool for OR?
cites work: Perturbation heuristics for the pickup and delivery traveling salesman problem
description: scientific article; zbMATH DE number 1910176