Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: programming: travelling salesman
Found
410 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Asymptotic expected performance of some TSP heuristics: An empirical evaluation
1989,
Ong H.L.
This paper presents an empirical study on the performance of some heuristics for the...
On the stochastic complexity of the asymmetric traveling salesman problem
1989,
Dost Hans-Ulrich
Based on the assignment problem relaxation, an approach is proposed for the stochastic...
A procedure for scheduling punch presses with restrictions on the sequence of punches
1990,
Shin Wan S.
Procedures for generating efficient schedules for punch presses are examined....
Optimal solution of a vehicle-routeing problem: Transporting mentally handicapped adults to an adult training centre
1990,
Sutcliffe Charles
Many organizations must devise tours for vehicles to collect from or deliver to a...
On the core of a traveling salesman cost allocation game
1989,
Tamir Arie
Let G=(V,E) be a connected undirected graph with positive edge lengths. Let...
A generalized k-opt exchange procedure for the MTSP
1989,
Rousseau Jean-Marc
This paper presents a technique that generalizes the classical k- opt exchange...
Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
1989,
Shallcross David F.
Determining efficient sequences of X-ray diffraction measurements on a four-circle...
A note on the traveling salesman problem
1989,
Chvtal V.
The paper observes that (i) the problem of recognizing instances of the traveling...
Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem
1989,
Miller D.L.
Computational results are presented for a parallel branch and bound algorithm that...
A probabilistic analysis of the switching algorithm for the Euclidean TSP
1989,
Kern Walter
The well-known switching algorithm proposed by Lin and Kernighan for the Euclidean...
Efficacy of spacefilling heuristics in Euclidean combinatorial optimization
1989,
Steele J. Michael
This note sharpens and generalizes an inequality of Platzman and Bartholdi on the...
Worst-case examples for the spacefilling curve heuristic for the Euclidean Travelling Salesman Problem
1989,
Bertsimas Dimitris
Bartholdi and Platzman proposed the spacefilling curve heuristic for the Euclidean...
New lower bounds for the Symmetric Travelling Salesman Problem
1989,
Carpaneto G.
In this paper new lower bounds for the Symmetric Travelling Salesman Problem are...
Some remarks on two degrees of asymmetry in the traveling salesman problem
1988,
Jeromin Bernd
The quality of a heuristic for the traveling salesman problem is determined by its...
IC insertion: An application of the travelling salesman problem
1989,
Chan Donald
Chip insertion problems arise naturally in electronic board assembly. Several examples...
An algorithm for the design of mailbox collection routes in urban areas
1989,
Laporte Gilbert
Mailbox collection is a complex and costly operation in most postal services. The...
Traveling salesman facility location problems
1989,
Bertsimas Dimitris J.
We consider two generic facility location problems, the traveling salesman facility...
The adult training centre problem: A case study
1989,
Okonjo-Adigwe C.
An optimal solution is found to a real-world problem which has the characteristics of...
Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem
1989,
Jeromin Bernd
Triangle inequality and symmetry play an important role in the treatment of the...
The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
1989,
Chiba Norishige
An algorithm is presented for finding a Hamiltonian cycle in 4-connected planar...
The parallel complexity of TSP Heuristics
1989,
Kindervater Gerard A.P.
The authors consider eight heuristics for constructing approximate solutions to the...
A simple linear expected time algorithm for finding a Hamiltonian path
1989,
Thomason Andrew
The paper gives a simple algorithm which either finds a hamilton path between two...
Constrained spanning trees and the traveling salesman problem
1989,
Leclerc Matthias
Minimum weight 1-trees provide a well-known lower bound for the symmetric traveling...
An approximation algorithm for the TSP
1989,
Basart J.M.
The authors present a new polynomial-time heuristic algorithm for finding a solution...
First Page
15
16
17
18
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers