52 search results - page 7 / 11 » Computing with Domino-Parity Inequalities for the Traveling ... |
TAMC
2009
Springer
14 years 10 hour ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
NETWORKS
2010
13 years 5 months ago
2010
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be...
DCOSS
2011
Springer
12 years 7 months ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
— One of the major drawbacks of the Hopfield network is that when it is applied to certain polytopes of combinatorial problems, such as the traveling salesman problem (TSP), the...
ICCBR
1995
Springer
13 years 11 months ago
1995
Springer
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...