- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j41 |      | Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis: Compact formulations of the Steiner Traveling Salesman Problem and related problems. European Journal of Operational Research 228(1): 83-92 (2013) |
| 2012 | ||
| j40 | | Adam N. Letchford, Sebastian J. Miller: Fast bounding procedures for large instances of the Simple Plant Location Problem. Computers & OR 39(5): 985-990 (2012) |
| j39 | | Adam N. Letchford, Michael M. Sørensen: Binary positive semidefinite matrices and associated integer polytopes. Math. Program. 131(1-2): 253-271 (2012) |
| j38 | | Laura Galli, Konstantinos Kaparis, Adam N. Letchford: Complexity results for the gap inequalities for the max-cut problem. Oper. Res. Lett. 40(3): 149-152 (2012) |
| c8 | | Laura Galli, Konstantinos Kaparis, Adam N. Letchford: Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm. ISCO 2012: 178-188 |
| i1 | | Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis: Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems. CoRR abs/1203.3854 (2012) |
| 2011 | ||
| j37 | | Alberto Caprara, Adam N. Letchford, Juan José Salazar González: Decorous Lower Bounds for Minimum Linear Arrangement. INFORMS Journal on Computing 23(1): 26-40 (2011) |
| j36 | | Matteo Fortini, Adam N. Letchford, Andrea Lodi, Klaus Michael Wenger: Computing compatible tours for the symmetric traveling salesman problem. Math. Program. Comput. 3(1): 59-78 (2011) |
| j35 | | Corinne Feremans, Martine Labbé, Adam N. Letchford, Juan José Salazar González: Generalized network design polyhedra. Networks 58(2): 125-136 (2011) |
| j34 | | Laura Galli, Konstantinos Kaparis, Adam N. Letchford: Gap inequalities for non-convex mixed-integer quadratic programs. Oper. Res. Lett. 39(5): 297-300 (2011) |
| j33 | | Adam N. Letchford, Sebastian Pokutta, Andreas S. Schulz: On the membership problem for the {0, 1/2}-closure. Oper. Res. Lett. 39(5): 301-304 (2011) |
| c7 | | Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio: A New Approach to the Stable Set Problem Based on Ellipsoids. IPCO 2011: 223-234 |
| 2010 | ||
| j32 | | Alberto Caprara, Adam N. Letchford, Juan José Salazar González: Lower Bounds for the Minimum Linear Arrangement of a Graph. Electronic Notes in Discrete Mathematics 36: 843-849 (2010) |
| j31 | | Konstantinos Kaparis, Adam N. Letchford: Separation algorithms for 0-1 knapsack polytopes. Math. Program. 124(1-2): 69-91 (2010) |
| j30 | | Alberto Caprara, Adam N. Letchford: New techniques for cost sharing in combinatorial optimization games. Math. Program. 124(1-2): 93-118 (2010) |
| j29 | | Laura Galli, Adam N. Letchford: Small bipartite subgraph polytopes. Oper. Res. Lett. 38(5): 337-340 (2010) |
| c6 | | |
| 2009 | ||
| j28 | | Adam N. Letchford, Amar Oukil: Exploiting sparsity in pricing routines for the capacitated arc routing problem. Computers & OR 36(7): 2320-2327 (2009) |
| j27 | | Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio: An application of the Lovász-Schrijver M(K, K) operator to the stable set problem. Math. Program. 120(2): 381-401 (2009) |
| j26 | | Samuel Burer, Adam N. Letchford: On Nonconvex Quadratic Programming with Box Constraints. SIAM Journal on Optimization 20(2): 1073-1089 (2009) |
| r1 | | Richard W. Eglese, Adam N. Letchford: General Routing Problem. Encyclopedia of Optimization 2009: 1252-1254 |
| 2008 | ||
| j25 | | Adam N. Letchford, Nicholas A. Pearson: Good triangulations yield good tours. Computers & OR 35(2): 638-647 (2008) |
| j24 | | Alistair R. Clark, Richard W. Eglese, Adam N. Letchford, Michael B. Wright: Preface. Discrete Applied Mathematics 156(3): 289-290 (2008) |
| j23 | | Adam N. Letchford, Nicholas A. Pearson: Exploiting planarity in separation routines for the symmetric traveling salesman problem. Discrete Optimization 5(2): 220-230 (2008) |
| j22 | | 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) |
| j21 | | 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) |
| j20 | | Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis: Odd Minimum Cut Sets and b-Matchings Revisited. SIAM J. Discrete Math. 22(4): 1480-1487 (2008) |
| c5 | | Adam N. Letchford, Michael M. Sørensen: Binary Positive Semidefinite Matrices and Associated Integer Polytopes. IPCO 2008: 125-139 |
| 2007 | ||
| j19 | | Adam N. Letchford, Andrea Lodi: The traveling salesman problem: a book review. 4OR 5(4): 315-317 (2007) |
| j18 | | |
| 2006 | ||
| j17 | | Lisa Fleischer, Adam N. Letchford, Andrea Lodi: Polynomial-Time Separation of a Superclass of Simple Comb Inequalities. Math. Oper. Res. 31(4): 696-713 (2006) |
| j16 | | Adam N. Letchford, Juan José Salazar González: Projection results for vehicle routing. Math. Program. 105(2-3): 251-274 (2006) |
| j15 | | Monia Giandomenico, Adam N. Letchford: Exploring the Relationship Between Max-Cut and Stable Set Relaxations. Math. Program. 106(1): 159-175 (2006) |
| 2005 | ||
| j14 | | 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 | ||
| j13 | | 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) |
| j12 | | |
| c4 | | Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis: A Faster Exact Separation Algorithm for Blossom Inequalities. IPCO 2004: 196-205 |
| 2003 | ||
| j11 | | |
| j10 | | Alberto Caprara, Adam N. Letchford: On the separation of split cuts and related inequalities. Math. Program. 94(2-3): 279-294 (2003) |
| j9 | | Adam N. Letchford: Binary clutter inequalities for integer programs. Math. Program. 98(1-3): 201-221 (2003) |
| 2002 | ||
| j8 | | Adam N. Letchford, Andrea Lodi: Primal cutting plane algorithms revisited. Math. Meth. of OR 56(1): 67-81 (2002) |
| j7 | | Adam N. Letchford, Richard W. Eglese, Jens Lysgaard: Multistars, partial multistars and the capacitated vehicle routing problem. Math. Program. 94(1): 21-40 (2002) |
| j6 | | |
| j5 | | Adam N. Letchford, Andrea Lodi: Strengthening Chvátal-Gomory cuts and Gomory fractional cuts. Oper. Res. Lett. 30(2): 74-82 (2002) |
| c3 | | Adam N. Letchford, Andrea Lodi: Polynomial-Time Separation of Simple Comb Inequalities. IPCO 2002: 93-108 |
| 2001 | ||
| j4 | | Adam N. Letchford, André R. S. Amaral: Analysis of upper bounds for the Pallet Loading Problem. European Journal of Operational Research 132(3): 582-593 (2001) |
| j3 | | Adam N. Letchford: On Disjunctive Cuts for Combinatorial Optimization. J. Comb. Optim. 5(3): 299-315 (2001) |
| c2 | | Adam N. Letchford, Andrea Lodi: An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming. Combinatorial Optimization 2001: 119-133 |
| 2000 | ||
| j2 | | Adam N. Letchford: Separating a Superclass of Comb Inequalities in Planar Graphs. Math. Oper. Res. 25(3): 443-454 (2000) |
| 1999 | ||
| j1 | | Adam N. Letchford: The general routing polyhedron: A unifying framework. European Journal of Operational Research 112(1): 122-133 (1999) |
| c1 | | Alberto Caprara, Matteo Fischetti, Adam N. Letchford: On the Separation of Maximally Violated mod-k Cuts. IPCO 1999: 87-98 |
Colors in the list of coauthors
Last update Fri May 24 11:24:12 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page