Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Traveling purchaser problem

Known as: TPP, Travelling purchaser problem 
The traveling purchaser problem (TPP) is an NP-hard problem studied in theoretical computer science. Given a list of marketplaces, the cost of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
School bus routing problems, combining bus stop selection and bus route generation, look simultaneously for a set of bus stops to… Expand
2010
2010
  • M. Choi, S. Lee
  • The 40th International Conference on Computers…
  • 2010
  • Corpus ID: 26138941
The traveling purchaser problem (TPP) is a generalization of the well-known traveling salesman problem (TSP) and has many real… Expand
  • figure 1
  • table 1
  • table I
2009
2009
In this paper an evolutionary algorithm is presented for the Traveling Purchaser Problem, an important variation of the Traveling… Expand
Highly Cited
2008
Highly Cited
2008
The traveling purchaser problem (TPP) is a generalization of the traveling salesman problem where markets have to be visited to… Expand
  • figure 2
  • figure 3
  • table 1
  • table 2
  • table 3
2006
2006
The Asymmetric Traveling Purchaser Problem (ATPP) is a generalization of the Asymmetric Traveling Salesman Problem with several… Expand
2005
2005
The purpose of this article is to present and solve the Biobjective Travelling Purchaser Problem, which consists in determining a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2003
2003
This article deals with two versions of the traveling purchaser problem. In the uncapacitated version, the number of units of a… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
1998
1998
Abstract The traveling purchaser problem (TPP) is a generalization of the well-known traveling salesman problem (TSP), which has… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Highly Cited
1996
Highly Cited
1996
  • S. Voß
  • Ann. Oper. Res.
  • 1996
  • Corpus ID: 13975798
Tabu search is a metastrategy for guiding known heuristics to overcome local optimality with a large number of successful… Expand
1982
1982
  • H. L. Ong
  • Oper. Res. Lett.
  • 1982
  • Corpus ID: 122933962
In this paper we study the generalized savings heuristics of Golden, Levy and Dahl and propose several new heuristic procedures… Expand