The rural postman problem with deadline classes. - Adam N. Letchford; Richard W. Eglese (Eur. J. Oper. Res., 1998)

On the Separation of Maximally Violated mod-k Cuts. - Alberto Caprara; Matteo Fischetti; Adam N. Letchford (IPCO, 1999)

The general routing polyhedron: A unifying framework. - Adam N. Letchford (Eur. J. Oper. Res., 1999)

Separating a Superclass of Comb Inequalities in Planar Graphs. - Adam N. Letchford (Math. Oper. Res., 2000)

On the separation of maximally violated mod- k cuts. - Alberto Caprara; Matteo Fischetti; Adam N. Letchford (Math. Program., 2000)

An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming. - Adam N. Letchford; Andrea Lodi 001 (Combinatorial Optimization, 2001)

Analysis of upper bounds for the Pallet Loading Problem. - Adam N. Letchford; André Renato Sales Amaral (Eur. J. Oper. Res., 2001)

On Disjunctive Cuts for Combinatorial Optimization. - Adam N. Letchford (J. Comb. Optim., 2001)

A cutting plane algorithm for the General Routing Problem. - Angel Corberán; Adam N. Letchford; José María Sanchis (Math. Program., 2001)

Polynomial-Time Separation of Simple Comb Inequalities. - Adam N. Letchford; Andrea Lodi 001 (IPCO, 2002)

Approximation Algorithms. - Adam N. Letchford (J. Oper. Res. Soc., 2002)

Primal cutting plane algorithms revisited. - Adam N. Letchford; Andrea Lodi 001 (Math. Methods Oper. Res., 2002)

Multistars, partial multistars and the capacitated vehicle routing problem. - Adam N. Letchford; Richard W. Eglese; Jens Lysgaard (Math. Program., 2002)

Totally tight Chvátal-Gomory cuts. - Adam N. Letchford (Oper. Res. Lett., 2002)

Strengthening Chvátal-Gomory cuts and Gomory fractional cuts. - Adam N. Letchford; Andrea Lodi 001 (Oper. Res. Lett., 2002)

Primal separation algorithms. - Adam N. Letchford; Andrea Lodi 001 (4OR, 2003)

On the separation of split cuts and related inequalities. - Alberto Caprara; Adam N. Letchford (Math. Program., 2003)

Binary clutter inequalities for integer programs. - Adam N. Letchford (Math. Program., 2003)

A Faster Exact Separation Algorithm for Blossom Inequalities. - Adam N. Letchford; Gerhard Reinelt; Dirk Oliver Theis (IPCO, 2004)

A new branch-and-cut algorithm for the capacitated vehicle routing problem. - Jens Lysgaard; Adam N. Letchford; Richard W. Eglese (Math. Program., 2004)

Book review. - Adam N. Letchford (Oper. Res. Lett., 2004)

A fast algorithm for minimum weight odd circuits and cuts in planar graphs. - Adam N. Letchford; Nicholas A. Pearson (Oper. Res. Lett., 2005)

Odd minimum cut sets and b-matchings revisited. - Adam N. Letchford; Dirk Oliver Theis (CoRR, 2006)

Polynomial-Time Separation of a Superclass of Simple Comb Inequalities. - Lisa Fleischer; Adam N. Letchford; Andrea Lodi 001 (Math. Oper. Res., 2006)

Exploring the Relationship Between Max-Cut and Stable Set Relaxations. - Monia Giandomenico; Adam N. Letchford (Math. Program., 2006)

Projection results for vehicle routing. - Adam N. Letchford; Juan José Salazar González (Math. Program., 2006)

The traveling salesman problem: a book review. - Adam N. Letchford; Andrea Lodi 001 (4OR, 2007)

Mixed integer programming. - Jon Lee 001; Adam N. Letchford (Discret. Optim., 2007)

A branch-and-cut algorithm for the capacitated open vehicle routing problem. - Adam N. Letchford; Jens Lysgaard; Richard W. Eglese (J. Oper. Res. Soc., 2007)

Good triangulations yield good tours. - Adam N. Letchford; Nicholas A. Pearson (Comput. Oper. Res., 2008)

Preface. - Alistair R. Clark; Richard W. Eglese; Adam N. Letchford; Michael B. Wright (Discret. Appl. Math., 2008)

Exploiting planarity in separation routines for the symmetric traveling salesman problem. - Adam N. Letchford; Nicholas A. Pearson (Discret. Optim., 2008)

A New Lower Bound for the Minimum Linear Arrangement of a Graph. - André Renato Sales Amaral; Alberto Caprara; Adam N. Letchford; Juan José Salazar González (Electron. Notes Discret. Math., 2008)

Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem. - Konstantinos Kaparis; Adam N. Letchford (Eur. J. Oper. Res., 2008)

Odd Minimum Cut Sets and b-Matchings Revisited. - Adam N. Letchford; Gerhard Reinelt; Dirk Oliver Theis (SIAM J. Discret. Math., 2008)

Exploiting sparsity in pricing routines for the capacitated arc routing problem. - Adam N. Letchford; Amar Oukil (Comput. Oper. Res., 2009)

An application of the Lovász-Schrijver M(K, K) operator to the stable set problem. - Monia Giandomenico; Adam N. Letchford; Fabrizio Rossi; Stefano Smriglio (Math. Program., 2009)

On Nonconvex Quadratic Programming with Box Constraints. - Samuel Burer; Adam N. Letchford (SIAM J. Optim., 2009)

General Routing Problem. - Richard W. Eglese; Adam N. Letchford (Encyclopedia of Optimization, 2009)

Integer Quadratic Quasi-polyhedra. - Adam N. Letchford (IPCO, 2010)

Lower Bounds for the Minimum Linear Arrangement of a Graph. - Alberto Caprara; Adam N. Letchford; Juan José Salazar González (Electron. Notes Discret. Math., 2010)

New techniques for cost sharing in combinatorial optimization games. - Alberto Caprara; Adam N. Letchford (Math. Program., 2010)

Separation algorithms for 0-1 knapsack polytopes. - Konstantinos Kaparis; Adam N. Letchford (Math. Program., 2010)

Small bipartite subgraph polytopes. - Laura Galli; Adam N. Letchford (Oper. Res. Lett., 2010)

A New Approach to the Stable Set Problem Based on Ellipsoids. - Monia Giandomenico; Adam N. Letchford; Fabrizio Rossi; Stefano Smriglio (IPCO, 2011)

Decorous Lower Bounds for Minimum Linear Arrangement. - Alberto Caprara; Adam N. Letchford; Juan José Salazar González (INFORMS J. Comput., 2011)

Computing compatible tours for the symmetric traveling salesman problem. - Matteo Fortini; Adam N. Letchford; Andrea Lodi 001; Klaus Michael Wenger (Math. Program. Comput., 2011)

Generalized network design polyhedra. - Corinne Feremans; Martine Labbé; Adam N. Letchford; Juan José Salazar González (Networks, 2011)

Gap inequalities for non-convex mixed-integer quadratic programs. - Laura Galli; Konstantinos Kaparis; Adam N. Letchford (Oper. Res. Lett., 2011)

On the membership problem for the {0, 1/2}-closure. - Adam N. Letchford; Sebastian Pokutta; Andreas S. Schulz (Oper. Res. Lett., 2011)

Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm. - Laura Galli; Konstantinos Kaparis; Adam N. Letchford (ISCO, 2012)

Fast bounding procedures for large instances of the Simple Plant Location Problem. - Adam N. Letchford; Sebastian J. Miller (Comput. Oper. Res., 2012)

Binary positive semidefinite matrices and associated integer polytopes. - Adam N. Letchford; Michael Malmros Sørensen (Math. Program., 2012)

Complexity results for the gap inequalities for the max-cut problem. - Laura Galli; Konstantinos Kaparis; Adam N. Letchford (Oper. Res. Lett., 2012)

Approximating the Lovász θ Function with the Subgradient Method. - Monia Giandomenico; Adam N. Letchford; Fabrizio Rossi; Stefano Smriglio (Electron. Notes Discret. Math., 2013)

Compact formulations of the Steiner Traveling Salesman Problem and related problems. - Adam N. Letchford; Saeideh D. Nasiri; Dirk Oliver Theis (Eur. J. Oper. Res., 2013)

A polyhedral approach to the single row facility layout problem. - André Renato Sales Amaral; Adam N. Letchford (Math. Program., 2013)

Pricing routines for vehicle routing with time windows on road networks. - Adam N. Letchford; Saeideh D. Nasiri; Amar Oukil (Comput. Oper. Res., 2014)

A new separation algorithm for the Boolean quadric and cut polytopes. - Adam N. Letchford; Michael Malmros Sørensen (Discret. Optim., 2014)

An aggressive reduction scheme for the simple plant location problem. - Adam N. Letchford; Sebastian J. Miller (Eur. J. Oper. Res., 2014)

A Dynamic Programming Heuristic for the Quadratic Knapsack Problem. - Franklin Djeumou Fomeni; Adam N. Letchford (INFORMS J. Comput., 2014)

Unbounded convex sets for non-convex mixed-integer quadratic programming. - Samuel Burer; Adam N. Letchford (Math. Program., 2014)

A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs. - Laura Galli; Adam N. Letchford (Optim. Lett., 2014)

Iterated Chvátal-Gomory Cuts and the Geometry of Numbers. - Iskander Aliev; Adam N. Letchford (SIAM J. Optim., 2014)

Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem. - Adam N. Letchford; Juan José Salazar González (Eur. J. Oper. Res., 2015)

The Steiner travelling salesman problem with correlated costs. - Adam N. Letchford; Saeideh D. Nasiri (Eur. J. Oper. Res., 2015)

Cutting planes for RLT relaxations of mixed 0-1 polynomial programs. - Franklin Djeumou Fomeni; Konstantinos Kaparis; Adam N. Letchford (Math. Program., 2015)

The 2013 Newton Institute Programme on polynomial optimization. - Adam N. Letchford; Jean B. Lasserre; Pablo A. Parrilo; David Steurer (Math. Program., 2015)

Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms. - Monia Giandomenico; Adam N. Letchford; Fabrizio Rossi; Stefano Smriglio (SIAM J. Optim., 2015)

Strengthening Chvátal-Gomory Cuts for the Stable Set Problem. - Adam N. Letchford; Francesca Marzi; Fabrizio Rossi; Stefano Smriglio (ISCO, 2016)

Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem. - Adam N. Letchford; Juan José Salazar González (Eur. J. Oper. Res., 2016)

An exact algorithm for a resource allocation problem in mobile wireless communications. - Adam N. Letchford; Qiang Ni; Zhaoyu Zhong (Comput. Optim. Appl., 2017)

Projection results for the -partition problem. - Jamie Fairbrother; Adam N. Letchford (Discret. Optim., 2017)

On the Lovász theta function and some variants. - Laura Galli; Adam N. Letchford (Discret. Optim., 2017)

A note on representations of linear inequalities in non-convex mixed-integer quadratic programs. - Adam N. Letchford; Daniel John Grainger (Oper. Res. Lett., 2017)

A Heuristic for Maximising Energy Efficiency in an OFDMA System Subject to QoS Constraints. - Adam N. Letchford; Qiang Ni; Zhaoyu Zhong (ISCO, 2018)

A two-level graph partitioning problem arising in mobile wireless communications. - Jamie Fairbrother; Adam N. Letchford; Keith Briggs (Comput. Optim. Appl., 2018)

New valid inequalities and facets for the Simple Plant Location Problem. - Laura Galli; Adam N. Letchford; Sebastian J. Miller (Eur. J. Oper. Res., 2018)

A binarisation heuristic for non-convex quadratic programming with box constraints. - Laura Galli; Adam N. Letchford (Oper. Res. Lett., 2018)

A note on the 2-circulant inequalities for the max-cut problem. - Konstantinos Kaparis; Adam N. Letchford (Oper. Res. Lett., 2018)

A guide to conic optimisation and its applications. - Adam N. Letchford; Andrew J. Parkes (RAIRO Oper. Res., 2018)

The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time. - Adam N. Letchford; Juan José Salazar González (Eur. J. Oper. Res., 2019)

On lifted cover inequalities: A new lifting procedure with unusual properties. - Adam N. Letchford; Georgia Souli (Oper. Res. Lett., 2019)

New valid inequalities for the fixed-charge and single-node flow polytopes. - Adam N. Letchford; Georgia Souli (Oper. Res. Lett., 2019)

Using ℓp-norms for fairness in combinatorial optimisation. - Tolga Bektas; Adam N. Letchford (Comput. Oper. Res., 2020)

The stable set problem: Clique and nodal inequalities revisited. - Adam N. Letchford; Fabrizio Rossi; Stefano Smriglio (Comput. Oper. Res., 2020)

On matroid parity and matching polytopes. - Konstantinos Kaparis; Adam N. Letchford; Ioannis Mourtos (Discret. Appl. Math., 2020)

Adaptive policies for perimeter surveillance problems. - James A. Grant; David S. Leslie; Kevin Glazebrook; Roberto Szechtman; Adam N. Letchford (Eur. J. Oper. Res., 2020)

A heuristic for fair dynamic resource allocation in overloaded OFDMA systems. - Adam N. Letchford; Qiang Ni; Zhaoyu Zhong (J. Heuristics, 2020)

Valid inequalities for mixed-integer programmes with fixed charges on sets of variables. - Adam N. Letchford; Georgia Souli (Oper. Res. Lett., 2020)

Lifting the knapsack cover inequalities for the knapsack polytope. - Adam N. Letchford; Georgia Souli (Oper. Res. Lett., 2020)

Vehicle routing on road networks: How good is Euclidean approximation? - Burak Boyaci; Thu Huong Dang; Adam N. Letchford (Comput. Oper. Res., 2021)

Valid inequalities for quadratic optimisation with domain constraints. - Laura Galli; Adam N. Letchford (Discret. Optim., 2021)

Bi-perspective functions for mixed-integer fractional programs with indicator variables. - Adam N. Letchford; Qiang Ni; Zhaoyu Zhong (Math. Program., 2021)

Facets from gadgets. - Adam N. Letchford; Anh N. Vu (Math. Program., 2021)

On the complexity of surrogate and group relaxation for integer linear programs. - Trivikram Dokka; Adam N. Letchford; M. Hasan Mansoor (Oper. Res. Lett., 2021)

A separation algorithm for the simple plant location problem. - Laura Galli; Adam N. Letchford (Oper. Res. Lett., 2021)

Strengthened clique-family inequalities for the stable set polytope. - Adam N. Letchford; Paolo Ventura (Oper. Res. Lett., 2021)

A cut-and-branch algorithm for the Quadratic Knapsack Problem. - Franklin Djeumou Fomeni; Konstantinos Kaparis; Adam N. Letchford (Discret. Optim., 2022)

Newsvendor problems: An integrated method for estimation and optimisation. - Congzheng Liu; Adam N. Letchford; Ivan Svetunkov (Eur. J. Oper. Res., 2022)

On matchings, T-joins, and arc routing in road networks. - Burak Boyaci; Thu Huong Dang; Adam N. Letchford (Networks, 2022)

Revisiting surrogate relaxation for the multidimensional knapsack problem. - Trivikram Dokka; Adam N. Letchford; M. Hasan Mansoor (Oper. Res. Lett., 2022)

Generalised 2-circulant inequalities for the max-cut problem. - Konstantinos Kaparis; Adam N. Letchford; Ioannis Mourtos (Oper. Res. Lett., 2022)

Improving a constructive heuristic for the general routing problem. - Burak Boyaci; Thu Huong Dang; Adam N. Letchford (Networks, 2023)

Fast upper and lower bounds for a large-scale real-world arc routing problem. - Burak Boyaci; Thu Huong Dang; Adam N. Letchford (Networks, 2023)

A survey on exact algorithms for the maximum flow and minimum-cost flow problems. - Oliverio Cruz-Mejia; Adam N. Letchford (Networks, 2023)

On some lower bounds for the permutation flowshop problem. - Sebastian Cáceres Gelvez; Thu Huong Dang; Adam N. Letchford (Comput. Oper. Res., 2023)

On cut polytopes and graph minors. - Konstantinos Kaparis; Adam N. Letchford; Ioannis Mourtos (Discret. Optim., 2023)

Matheuristics: survey and synthesis. - Marco A. Boschetti; Adam N. Letchford; Vittorio Maniezzo (Int. Trans. Oper. Res., 2023)

CP-Lib: Benchmark Instances of the Clique Partitioning Problem. - Michael Malmros Sørensen; Adam N. Letchford (Math. Program. Comput., 2024)

On upper bounds for the multiple knapsack assignment problem. - Laura Galli; Adam N. Letchford (Oper. Res. Lett., 2024)

On a variant of the change-making problem. - Adam N. Letchford; Licong Cheng (Oper. Res. Lett., 2024)

Operational Research: methods and applications. - Fotios Petropoulos; Gilbert Laporte; Emel Aktas; Sibel A. Alumur; Claudia Archetti; Hayriye Ayhan; Maria Battarra; Julia A. Bennell; Jean-Marie Bourjolly; John E. Boylan; Michèle Breton; David Canca; et al. (J. Oper. Res. Soc., 2024)

New facets of the clique partitioning polytope. - Adam N. Letchford; Michael Malmros Sørensen (Oper. Res. Lett., 2025)