Letchford A.N.

A.N. Letchford

Information about the author A.N. Letchford will soon be added to the site.
Found 11 papers in total
A branch-and-cut algorithm for the capacitated open vehicle routing problem
A branch-and-cut algorithm for the capacitated open vehicle routing problem
2007
In open vehicle routing problems, the vehicles are not required to return to the depot...
Primal separation algorithms
Primal separation algorithms
2003
Given an integer polyhedron P I ⊂ ℝ n , an integer point &xmacr; ∈ P I ,...
Binary clutter inequalities for integer programs
Binary clutter inequalities for integer programs
2003
We introduce a new class of valid inequalities for general integer linear programs,...
On the separation of split cuts and related inequalities
On the separation of split cuts and related inequalities
2003
The split cuts of Cook, Kannan and Schrijver are general-purpose valid inequalities...
Primal cutting plane algorithms revisited
Primal cutting plane algorithms revisited
2002
Dual fractional cutting plane algorithms, in which cutting planes are used to...
Multistars, partial multistars and the capacitated vehicle routing problem
Multistars, partial multistars and the capacitated vehicle routing problem
2002
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated...
Theory of Linear and Integer Programming
Theory of Linear and Integer Programming
2000
Model Building in Mathematical Programming: Fourth Edition
Model Building in Mathematical Programming: Fourth Edition
2000
A cutting plane algorithm for the general routing problem
A cutting plane algorithm for the general routing problem
2001
The General Routing Problem (GRP) is the problem of finding a minimum cost route for a...
On the separation of maximally violated mod-k cuts
On the separation of maximally violated mod-k cuts
2000
Separation is of fundamental importance in cutting-plane based techniques for Integer...
The rural postman problem with deadline classes
The rural postman problem with deadline classes
1998
Vehicle routing problems with general time windows are extremely difficult to solve....
Papers per page: