Adam N. Letchford

Most-cited papers

Non-convex mixed-integer nonlinear programming: A survey
S. Burer, Adam N. Letchford
2012639 citations
Semantic Scholar
Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems
Adam N. Letchford, S. Nasiri, D. Theis
2012European Journal of Operational Research118 citations Open access
Semantic Scholar
Operational Research: methods and applications
F. Petropoulos, G. Laporte, E. Aktas, Sibel A. Alumur +78 more
2023Journal of the Operational Research Society117 citations Open access
Semantic Scholar
A polyhedral approach to the single row facility layout problem
André R. S. Amaral, Adam N. Letchford
2013Mathematical programming109 citations
Semantic Scholar
Detecting Changes in Slope With an L0 Penalty
P. Fearnhead, Robert Maidstone, Adam N. Letchford
2017Journal of Computational And Graphical Statistics75 citations Open access
Semantic Scholar
Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem
Adam N. Letchford, Juan José SALAZAR-GONZÁLEZ
2015European Journal of Operational Research61 citations Open access
Semantic Scholar
A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
F. D. Fomeni, Adam N. Letchford
2014INFORMS journal on computing55 citations Open access
Semantic Scholar
Pricing routines for vehicle routing with time windows on road networks
Adam N. Letchford, S. Nasiri, Amar Oukil
2014Computers & Operations Research42 citations Open access
Semantic Scholar
Newsvendor problems: An integrated method for estimation and optimisation
Cong-Zheng Liu, Adam N. Letchford, Ivan Svetunkov
2021European Journal of Operational Research38 citations Open access
Semantic Scholar
The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time
Adam N. Letchford, Juan José SALAZAR-GONZÁLEZ
2019European Journal of Operational Research38 citations Open access
Semantic Scholar
Vehicle routing on road networks: How good is Euclidean approximation?
Burak Boyaci, Thu Huong Dang, Adam N. Letchford
2021Computers & Operations Research34 citations Open access
Semantic Scholar
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
O. Cruz-Mejía, Adam N. Letchford
2023Networks30 citations Open access
Semantic Scholar
An aggressive reduction scheme for the simple plant location problem
Adam N. Letchford, Sebastian J. Miller
2014European Journal of Operational Research30 citations
Semantic Scholar
A cut-and-branch algorithm for the Quadratic Knapsack Problem
F. D. Fomeni, Konstantinos Kaparis, Adam N. Letchford
2020Discrete Optimization28 citations Open access
Semantic Scholar
On lifted cover inequalities: A new lifting procedure with unusual properties
Adam N. Letchford, Georgia Souli
2019Operations Research Letters27 citations Open access
Semantic Scholar
Matheuristics: survey and synthesis
Marco A. Boschetti, Adam N. Letchford, V. Maniezzo
2023International Transactions in Operational Research25 citations Open access
Semantic Scholar
Using ℓp-norms for fairness in combinatorial optimisation
T. Bektaş, Adam N. Letchford
2020Computers & Operations Research24 citations
Semantic Scholar
Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
Adam N. Letchford, Juan José SALAZAR-GONZÁLEZ
2016European Journal of Operational Research23 citations Open access
Semantic Scholar
A two-level graph partitioning problem arising in mobile wireless communications
Jamie Fairbrother, Adam N. Letchford, K. Briggs
2017Computational optimization and applications21 citations Open access
Semantic Scholar
The stable set problem: Clique and nodal inequalities revisited
Adam N. Letchford, Fabrizio Rossi, S. Smriglio
2020Computers & Operations Research20 citations Open access
Semantic Scholar
A compact variant of the QCR method for quadratically constrained quadratic 0–1 programs
Laura Galli, Adam N. Letchford
2013Optimization Letters20 citations Open access
Semantic Scholar
Fast bounding procedures for large instances of the Simple Plant Location Problem
Adam N. Letchford, Sebastian J. Miller
2012Computers & Operations Research19 citations Open access
Semantic Scholar
Unbounded convex sets for non-convex mixed-integer quadratic programming
S. Burer, Adam N. Letchford
2014Mathematical programming18 citations Open access
Semantic Scholar
A new separation algorithm for the Boolean quadric and cut polytopes
Adam N. Letchford, M. Sørensen
2014Discrete Optimization17 citations Open access
Semantic Scholar
The Steiner travelling salesman problem with correlated costs
Adam N. Letchford, S. Nasiri
2015European Journal of Operational Research15 citations
Semantic Scholar
On the Lovász theta function and some variants
Laura Galli, Adam N. Letchford
2017Discrete Optimization14 citations Open access
Semantic Scholar
Adaptive Policies for Perimeter Surveillance Problems
James A. Grant, David S. Leslie, K. Glazebrook, R. Szechtman +1 more
2018European Journal of Operational Research13 citations Open access
Semantic Scholar
An exact algorithm for a resource allocation problem in mobile wireless communications
Adam N. Letchford, Q. Ni, Z. Zhong
2017Computational optimization and applications12 citations Open access
Semantic Scholar
Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms
Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, S. Smriglio
2015SIAM Journal on Optimization12 citations Open access
Semantic Scholar
New valid inequalities and facets for the Simple Plant Location Problem
Laura Galli, Adam N. Letchford, Sebastian J. Miller
2018European Journal of Operational Research11 citations Open access
Semantic Scholar
Cutting planes for RLT relaxations of mixed 0–1 polynomial programs
F. D. Fomeni, Konstantinos Kaparis, Adam N. Letchford
2015Mathematical programming11 citations
Semantic Scholar
A guide to conic optimisation and its applications
Adam N. Letchford, A. Parkes
2018RAIRO Oper. Res.10 citations Open access
Semantic Scholar
Projection results for the -partition problem
Jamie Fairbrother, Adam N. Letchford
2017Discrete Optimization10 citations Open access
Semantic Scholar
On Laminar Matroids and b-Matchings
Konstantinos Kaparis, Adam N. Letchford
20148 citations
Semantic Scholar
Lifting the knapsack cover inequalities for the knapsack polytope
Adam N. Letchford, Georgia Souli
2020Operations Research Letters7 citations Open access
Semantic Scholar
On some lower bounds for the permutation flowshop problem
Sebastian Cáceres Gelvez, Thu Huong Dang, Adam N. Letchford
2023Computers & Operations Research6 citations Open access
Semantic Scholar
Revisiting surrogate relaxation for the multidimensional knapsack problem
Trivikram Dokka, Adam N. Letchford, M. H. Mansoor
2022Operations Research Letters6 citations Open access
Semantic Scholar
Approximating the Lovász θ Function with the Subgradient Method
Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, S. Smriglio
2013Electron. Notes Discret. Math.6 citations
Semantic Scholar
Complexity results for the gap inequalities for the max-cut problem
Laura Galli, Konstantinos Kaparis, Adam N. Letchford
2012Operations Research Letters6 citations Open access
Semantic Scholar
On matroid parity and matching polytopes
Konstantinos Kaparis, Adam N. Letchford, I. Mourtos
2020Discrete Applied Mathematics5 citations Open access
Semantic Scholar
New valid inequalities for the fixed-charge and single-node flow polytopes
Adam N. Letchford, Georgia Souli
2019Operations Research Letters5 citations Open access
Semantic Scholar
Improving a constructive heuristic for the general routing problem
Burak Boyaci, Thu Huong Dang, Adam N. Letchford
2022Networks4 citations Open access
Semantic Scholar
Strengthened clique-family inequalities for the stable set polytope
Adam N. Letchford, P. Ventura
2021Operations Research Letters4 citations Open access
Semantic Scholar
On matchings, T‐joins, and arc routing in road networks
Burak Boyaci, Thu Huong Dang, Adam N. Letchford
2021Networks4 citations Open access
Semantic Scholar
On the complexity of surrogate and group relaxation for integer linear programs
Trivikram Dokka, Adam N. Letchford, M. H. Mansoor
2021Operations Research Letters4 citations Open access
Semantic Scholar
Bi-perspective functions for mixed-integer fractional programs with indicator variables
Adam N. Letchford, Qiang Ni, Z. Zhong
2020Mathematical programming4 citations Open access
Semantic Scholar
Facets from gadgets
Adam N. Letchford, Anh Vu
2019Mathematical programming4 citations Open access
Semantic Scholar
A Heuristic for Maximising Energy Efficiency in an OFDMA System Subject to QoS Constraints
Adam N. Letchford, Q. Ni, Z. Zhong
2018International Symposium on Combinatorial Optimization4 citations
Semantic Scholar
Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm
Laura Galli, Konstantinos Kaparis, Adam N. Letchford
2012International Symposium on Combinatorial Optimization4 citations
Semantic Scholar
Ecient Analysis of Complex Changepoint Models
Robert Maidstone, P. Fearnhead, Adam N. Letchford
20124 citations
Semantic Scholar