| 2009 |
|---|
| 24 | EE | Richard W. Eglese,
Adam N. Letchford:
General Routing Problem.
Encyclopedia of Optimization 2009: 1252-1254 |
| 23 | EE | Adam N. Letchford,
Amar Oukil:
Exploiting sparsity in pricing routines for the capacitated arc routing problem.
Computers & OR 36(7): 2320-2327 (2009) |
| 2008 |
|---|
| 22 | EE | Adam N. Letchford,
Michael M. Sørensen:
Binary Positive Semidefinite Matrices and Associated Integer Polytopes.
IPCO 2008: 125-139 |
| 21 | EE | Adam N. Letchford,
Nicholas A. Pearson:
Good triangulations yield good tours.
Computers & OR 35(2): 638-647 (2008) |
| 20 | EE | Alistair R. Clark,
Richard W. Eglese,
Adam N. Letchford,
Michael B. Wright:
Preface.
Discrete Applied Mathematics 156(3): 289-290 (2008) |
| 19 | EE | Adam N. Letchford,
Nicholas A. Pearson:
Exploiting planarity in separation routines for the symmetric traveling salesman problem.
Discrete Optimization 5(2): 220-230 (2008) |
| 18 | EE | André R. S. Amaral,
Alberto Caprara,
Adam N. Letchford,
Juan José Salazar González:
A New Lower Bound for the Minimum Linear Arrangement of a Graph.
Electronic Notes in Discrete Mathematics 30: 87-92 (2008) |
| 17 | EE | Konstantinos Kaparis,
Adam N. Letchford:
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem.
European Journal of Operational Research 186(1): 91-103 (2008) |
| 2007 |
|---|
| 16 | EE | Adam N. Letchford,
Andrea Lodi:
The traveling salesman problem: a book review.
4OR 5(4): 315-317 (2007) |
| 15 | EE | Jon Lee,
Adam N. Letchford:
Mixed integer programming.
Discrete Optimization 4(1): 1-2 (2007) |
| 2006 |
|---|
| 14 | EE | Adam N. Letchford,
Juan José Salazar González:
Projection results for vehicle routing.
Math. Program. 105(2-3): 251-274 (2006) |
| 13 | EE | Monia Giandomenico,
Adam N. Letchford:
Exploring the Relationship Between Max-Cut and Stable Set Relaxations.
Math. Program. 106(1): 159-175 (2006) |
| 2005 |
|---|
| 12 | EE | Adam N. Letchford,
Nicholas A. Pearson:
A fast algorithm for minimum weight odd circuits and cuts in planar graphs.
Oper. Res. Lett. 33(6): 625-628 (2005) |
| 2004 |
|---|
| 11 | EE | Adam N. Letchford,
Gerhard Reinelt,
Dirk Oliver Theis:
A Faster Exact Separation Algorithm for Blossom Inequalities.
IPCO 2004: 196-205 |
| 10 | EE | Jens Lysgaard,
Adam N. Letchford,
Richard W. Eglese:
A new branch-and-cut algorithm for the capacitated vehicle routing problem.
Math. Program. 100(2): 423-445 (2004) |
| 9 | EE | Adam N. Letchford:
Book review.
Oper. Res. Lett. 32(4): 393-394 (2004) |
| 2003 |
|---|
| 8 | EE | Adam N. Letchford,
Andrea Lodi:
Primal separation algorithms.
4OR 1(3): 209-224 (2003) |
| 2002 |
|---|
| 7 | EE | Adam N. Letchford,
Andrea Lodi:
Polynomial-Time Separation of Simple Comb Inequalities.
IPCO 2002: 93-108 |
| 6 | EE | Adam N. Letchford:
Totally tight Chvátal-Gomory cuts.
Oper. Res. Lett. 30(2): 71-73 (2002) |
| 5 | EE | Adam N. Letchford,
Andrea Lodi:
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts.
Oper. Res. Lett. 30(2): 74-82 (2002) |
| 2001 |
|---|
| 4 | EE | Adam N. Letchford,
Andrea Lodi:
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming.
Combinatorial Optimization 2001: 119-133 |
| 3 | | Adam N. Letchford:
On Disjunctive Cuts for Combinatorial Optimization.
J. Comb. Optim. 5(3): 299-315 (2001) |
| 2000 |
|---|
| 2 | EE | Adam N. Letchford:
Separating a Superclass of Comb Inequalities in Planar Graphs.
Math. Oper. Res. 25(3): 443-454 (2000) |
| 1999 |
|---|
| 1 | EE | Alberto Caprara,
Matteo Fischetti,
Adam N. Letchford:
On the Separation of Maximally Violated mod-k Cuts.
IPCO 1999: 87-98 |
