Letchford Adam N.

Adam N. Letchford

Information about the author Adam N. Letchford will soon be added to the site.
Found 7 papers in total
Exploiting planarity in separation routines for the symmetric traveling salesman problem
Exploiting planarity in separation routines for the symmetric traveling salesman problem
2008
At present, the most successful approach for solving large-scale instances of the...
Good triangulations yield good tour
Good triangulations yield good tour
2008
Consider the following heuristic for planar Euclidean instances of the traveling...
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
2005
We give a simple O( n 3/2 log n ) algorithm for finding a minimum weight odd circuit...
Analysis of upper bounds for the pallet loading problem
Analysis of upper bounds for the pallet loading problem
2001
This paper is concerned with upper bounds for the well-known Pallet Loading Problem,...
The general routing polyhedron: A unifying framework
The general routing polyhedron: A unifying framework
1999
It is shown how to transform the General Routing Problem (GRP) into a variant of the...
New inequalities for the General Routing Problems
New inequalities for the General Routing Problems
1997
A large new class of valid inequalities is introduced for the General Routing Problem...
Allocation of school bus contracts by integer programming
Allocation of school bus contracts by integer programming
1996
When public transport is put out to tender, the task of allocating contracts to...
Papers per page: