Adam N. Letchford

ORCID

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 50

Top Venues

Publications

Laura Galli, Adam N. Letchford
On upper bounds for the multiple knapsack assignment problem. Oper. Res. Lett. 54 (2024)
Michael Malmros Sørensen, Adam N. Letchford
CP-Lib: Benchmark Instances of the Clique Partitioning Problem. Math. Program. Comput. 16 (1) (2024)
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, Laurent Charlin, Bo Chen, Cihan Tugrul Cicek, Louis Anthony Cox, Christine S. M. Currie, Erik Demeulemeester, Li Ding, Stephen M. Disney, Matthias Ehrgott, Martin J. Eppler, Günes Erdogan, Bernard Fortz, L. Alberto Franco, Jens Frische, Salvatore Greco, Amanda J. Gregory, Raimo P. Hämäläinen, Willy Herroelen, Mike Hewitt, Jan Holmström, John N. Hooker, Tugçe Isik, Jill Johnes, Bahar Yetis Kara, Özlem Karsu, Katherine Kent, Charlotte Köhler, Martin H. Kunc, Yong-Hong Kuo, Adam N. Letchford, Janny Leung, Dong Li, Haitao Li, Judit Lienert, Ivana Ljubic, Andrea Lodi, Sebastián Lozano, Virginie Lurkin, Silvano Martello, Ian G. McHale, Gerald Midgley, John D. W. Morecroft, Akshay Mutha, Ceyda Oguz, Sanja Petrovic, Ulrich Pferschy, Harilaos N. Psaraftis, Sam Rose, Lauri Saarinen, Saïd Salhi, Jing-Sheng Song, Dimitrios Sotiros, Kathryn E. Stecke, Arne K. Strauss, Istenç Tarhan, Clemens Thielen, Paolo Toth, Tom Van Woensel, Greet Vanden Berghe, Christos Vasilakis, Vikrant Vaze, Daniele Vigo, Kai Virtanen, Xun Wang, Rafal Weron, Leroy White, Mike Yearworth, E. Alper Yildirim, Georges Zaccour, Xuying Zhao
Operational Research: methods and applications. J. Oper. Res. Soc. 75 (3) (2024)
Marco A. Boschetti, Adam N. Letchford, Vittorio Maniezzo
Matheuristics: survey and synthesis. Int. Trans. Oper. Res. 30 (6) (2023)
Sebastian Cáceres Gelvez, Thu Huong Dang, Adam N. Letchford
On some lower bounds for the permutation flowshop problem. Comput. Oper. Res. 159 (2023)
Burak Boyaci, Thu Huong Dang, Adam N. Letchford
Fast upper and lower bounds for a large-scale real-world arc routing problem. Networks 81 (1) (2023)
Burak Boyaci, Thu Huong Dang, Adam N. Letchford
Improving a constructive heuristic for the general routing problem. Networks 81 (1) (2023)
Oliverio Cruz-Mejia, Adam N. Letchford
A survey on exact algorithms for the maximum flow and minimum-cost flow problems. Networks 82 (2) (2023)
Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos
On cut polytopes and graph minors. Discret. Optim. 50 (2023)
Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos
Generalised 2-circulant inequalities for the max-cut problem. Oper. Res. Lett. 50 (2) (2022)
Trivikram Dokka, Adam N. Letchford, M. Hasan Mansoor
Revisiting surrogate relaxation for the multidimensional knapsack problem. Oper. Res. Lett. 50 (6) (2022)
Franklin Djeumou Fomeni, Konstantinos Kaparis, Adam N. Letchford
A cut-and-branch algorithm for the Quadratic Knapsack Problem. Discret. Optim. 44 (Part) (2022)
Burak Boyaci, Thu Huong Dang, Adam N. Letchford
On matchings, T-joins, and arc routing in road networks. Networks 79 (1) (2022)
Congzheng Liu, Adam N. Letchford, Ivan Svetunkov
Newsvendor problems: An integrated method for estimation and optimisation. Eur. J. Oper. Res. 300 (2) (2022)
Laura Galli, Adam N. Letchford
Valid inequalities for quadratic optimisation with domain constraints. Discret. Optim. 41 (2021)
Burak Boyaci, Thu Huong Dang, Adam N. Letchford
Vehicle routing on road networks: How good is Euclidean approximation? Comput. Oper. Res. 129 (2021)
Adam N. Letchford, Paolo Ventura
Strengthened clique-family inequalities for the stable set polytope. Oper. Res. Lett. 49 (4) (2021)
Adam N. Letchford, Qiang Ni, Zhaoyu Zhong
Bi-perspective functions for mixed-integer fractional programs with indicator variables. Math. Program. 190 (1) (2021)
Laura Galli, Adam N. Letchford
A separation algorithm for the simple plant location problem. Oper. Res. Lett. 49 (4) (2021)
Adam N. Letchford, Anh N. Vu
Facets from gadgets. Math. Program. 185 (1-2) (2021)
Trivikram Dokka, Adam N. Letchford, M. Hasan Mansoor
On the complexity of surrogate and group relaxation for integer linear programs. Oper. Res. Lett. 49 (4) (2021)
Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio
The stable set problem: Clique and nodal inequalities revisited. Comput. Oper. Res. 123 (2020)
Adam N. Letchford, Georgia Souli
Lifting the knapsack cover inequalities for the knapsack polytope. Oper. Res. Lett. 48 (5) (2020)
Adam N. Letchford, Qiang Ni, Zhaoyu Zhong
A heuristic for fair dynamic resource allocation in overloaded OFDMA systems. J. Heuristics 26 (1) (2020)
James A. Grant, David S. Leslie, Kevin Glazebrook, Roberto Szechtman, Adam N. Letchford
Adaptive policies for perimeter surveillance problems. Eur. J. Oper. Res. 283 (1) (2020)
Tolga Bektas, Adam N. Letchford
-norms for fairness in combinatorial optimisation. Comput. Oper. Res. 120 (2020)
Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos
On matroid parity and matching polytopes. Discret. Appl. Math. 284 (2020)
Adam N. Letchford, Georgia Souli
Valid inequalities for mixed-integer programmes with fixed charges on sets of variables. Oper. Res. Lett. 48 (3) (2020)
Adam N. Letchford, Juan José Salazar González
The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time. Eur. J. Oper. Res. 272 (1) (2019)
Adam N. Letchford, Georgia Souli
On lifted cover inequalities: A new lifting procedure with unusual properties. Oper. Res. Lett. 47 (2) (2019)
Adam N. Letchford, Georgia Souli
New valid inequalities for the fixed-charge and single-node flow polytopes. Oper. Res. Lett. 47 (5) (2019)
Adam N. Letchford, Qiang Ni, Zhaoyu Zhong
A Heuristic for Maximising Energy Efficiency in an OFDMA System Subject to QoS Constraints. ISCO (2018)
Konstantinos Kaparis, Adam N. Letchford
A note on the 2-circulant inequalities for the max-cut problem. Oper. Res. Lett. 46 (4) (2018)
Adam N. Letchford, Andrew J. Parkes
A guide to conic optimisation and its applications. RAIRO Oper. Res. 52 (4) (2018)
James A. Grant, David S. Leslie, Kevin Glazebrook, Roberto Szechtman, Adam N. Letchford
Adaptive Policies for Perimeter Surveillance Problems. CoRR (2018)
Laura Galli, Adam N. Letchford
A binarisation heuristic for non-convex quadratic programming with box constraints. Oper. Res. Lett. 46 (5) (2018)
Jamie Fairbrother, Adam N. Letchford, Keith Briggs
A two-level graph partitioning problem arising in mobile wireless communications. Comput. Optim. Appl. 69 (3) (2018)
Laura Galli, Adam N. Letchford, Sebastian J. Miller
New valid inequalities and facets for the Simple Plant Location Problem. Eur. J. Oper. Res. 269 (3) (2018)
Laura Galli, Adam N. Letchford
On the Lovász theta function and some variants. Discret. Optim. 25 (2017)
Jamie Fairbrother, Adam N. Letchford
Projection results for the -partition problem. Discret. Optim. 26 (2017)
Jamie Fairbrother, Adam N. Letchford, Keith Briggs
A Two-Level Graph Partitioning Problem Arising in Mobile Wireless Communications. CoRR (2017)
Adam N. Letchford, Qiang Ni, Zhaoyu Zhong
An exact algorithm for a resource allocation problem in mobile wireless communications. Comput. Optim. Appl. 68 (2) (2017)
Adam N. Letchford, Daniel John Grainger
A note on representations of linear inequalities in non-convex mixed-integer quadratic programs. Oper. Res. Lett. 45 (6) (2017)
Adam N. Letchford, Francesca Marzi, Fabrizio Rossi, Stefano Smriglio
Strengthening Chvátal-Gomory Cuts for the Stable Set Problem. ISCO (2016)
Adam N. Letchford, Juan José Salazar González
Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem. Eur. J. Oper. Res. 251 (1) (2016)
Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio
Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms. SIAM J. Optim. 25 (3) (2015)
Adam N. Letchford, Jean B. Lasserre, Pablo A. Parrilo, David Steurer
The 2013 Newton Institute Programme on polynomial optimization. Math. Program. 151 (2) (2015)
Adam N. Letchford, Saeideh D. Nasiri
The Steiner travelling salesman problem with correlated costs. Eur. J. Oper. Res. 245 (1) (2015)
Franklin Djeumou Fomeni, Konstantinos Kaparis, Adam N. Letchford
Cutting planes for RLT relaxations of mixed 0-1 polynomial programs. Math. Program. 151 (2) (2015)
Adam N. Letchford, Juan José Salazar González
Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem. Eur. J. Oper. Res. 244 (3) (2015)
Adam N. Letchford, Saeideh D. Nasiri, Amar Oukil
Pricing routines for vehicle routing with time windows on road networks. Comput. Oper. Res. 51 (2014)
Iskander Aliev, Adam N. Letchford
Iterated Chvátal-Gomory Cuts and the Geometry of Numbers. SIAM J. Optim. 24 (3) (2014)
Samuel Burer, Adam N. Letchford
Unbounded convex sets for non-convex mixed-integer quadratic programming. Math. Program. 143 (1-2) (2014)
Adam N. Letchford, Sebastian J. Miller
An aggressive reduction scheme for the simple plant location problem. Eur. J. Oper. Res. 234 (3) (2014)
Laura Galli, Adam N. Letchford
A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs. Optim. Lett. 8 (4) (2014)
Adam N. Letchford, Michael M. Sørensen
A new separation algorithm for the Boolean quadric and cut polytopes. Discret. Optim. 14 (2014)
Franklin Djeumou Fomeni, Adam N. Letchford
A Dynamic Programming Heuristic for the Quadratic Knapsack Problem. INFORMS J. Comput. 26 (1) (2014)
André Renato Sales Amaral, Adam N. Letchford
A polyhedral approach to the single row facility layout problem. Math. Program. 141 (1-2) (2013)
Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio
Approximating the Lovász θ Function with the Subgradient Method. Electron. Notes Discret. Math. 41 (2013)
Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis
Compact formulations of the Steiner Traveling Salesman Problem and related problems. Eur. J. Oper. Res. 228 (1) (2013)
Laura Galli, Konstantinos Kaparis, Adam N. Letchford
Complexity results for the gap inequalities for the max-cut problem. Oper. Res. Lett. 40 (3) (2012)
Adam N. Letchford, Sebastian J. Miller
Fast bounding procedures for large instances of the Simple Plant Location Problem. Comput. Oper. Res. 39 (5) (2012)
Adam N. Letchford, Michael M. Sørensen
Binary positive semidefinite matrices and associated integer polytopes. Math. Program. 131 (1-2) (2012)
Laura Galli, Konstantinos Kaparis, Adam N. Letchford
Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm. ISCO (2012)
Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis
Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems CoRR (2012)
Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio
A New Approach to the Stable Set Problem Based on Ellipsoids. IPCO (2011)
Corinne Feremans, Martine Labbé, Adam N. Letchford, Juan José Salazar González
Generalized network design polyhedra. Networks 58 (2) (2011)
Alberto Caprara, Adam N. Letchford, Juan José Salazar González
Decorous Lower Bounds for Minimum Linear Arrangement. INFORMS J. Comput. 23 (1) (2011)
Matteo Fortini, Adam N. Letchford, Andrea Lodi, Klaus Michael Wenger
Computing compatible tours for the symmetric traveling salesman problem. Math. Program. Comput. 3 (1) (2011)
Adam N. Letchford, Sebastian Pokutta, Andreas S. Schulz
On the membership problem for the {0, 1/2}-closure. Oper. Res. Lett. 39 (5) (2011)
Laura Galli, Konstantinos Kaparis, Adam N. Letchford
Gap inequalities for non-convex mixed-integer quadratic programs. Oper. Res. Lett. 39 (5) (2011)
Konstantinos Kaparis, Adam N. Letchford
Separation algorithms for 0-1 knapsack polytopes. Math. Program. 124 (1-2) (2010)
Laura Galli, Adam N. Letchford
Small bipartite subgraph polytopes. Oper. Res. Lett. 38 (5) (2010)
Adam N. Letchford
Integer Quadratic Quasi-polyhedra. IPCO (2010)
Alberto Caprara, Adam N. Letchford
New techniques for cost sharing in combinatorial optimization games. Math. Program. 124 (1-2) (2010)
Alberto Caprara, Adam N. Letchford, Juan José Salazar González
Lower Bounds for the Minimum Linear Arrangement of a Graph. Electron. Notes Discret. Math. 36 (2010)
Samuel Burer, Adam N. Letchford
On Nonconvex Quadratic Programming with Box Constraints. SIAM J. Optim. 20 (2) (2009)
Adam N. Letchford, Amar Oukil
Exploiting sparsity in pricing routines for the capacitated arc routing problem. Comput. Oper. Res. 36 (7) (2009)
Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio
) operator to the stable set problem. Math. Program. 120 (2) (2009)
André Renato Sales Amaral, Alberto Caprara, Adam N. Letchford, Juan José Salazar González
A New Lower Bound for the Minimum Linear Arrangement of a Graph. Electron. Notes Discret. Math. 30 (2008)
Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis
Odd Minimum Cut Sets and b-Matchings Revisited. SIAM J. Discret. Math. 22 (4) (2008)
Konstantinos Kaparis, Adam N. Letchford
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 186 (1) (2008)
Adam N. Letchford, Michael M. Sørensen
Binary Positive Semidefinite Matrices and Associated Integer Polytopes. IPCO (2008)
Adam N. Letchford, Nicholas A. Pearson
Good triangulations yield good tours. Comput. Oper. Res. 35 (2) (2008)
Adam N. Letchford, Nicholas A. Pearson
Exploiting planarity in separation routines for the symmetric traveling salesman problem. Discret. Optim. 5 (2) (2008)
Alistair R. Clark, Richard W. Eglese, Adam N. Letchford, Michael B. Wright
Preface. Discret. Appl. Math. 156 (3) (2008)
Adam N. Letchford, Jens Lysgaard, Richard W. Eglese
A branch-and-cut algorithm for the capacitated open vehicle routing problem. J. Oper. Res. Soc. 58 (12) (2007)
Jon Lee, Adam N. Letchford
Mixed integer programming. Discret. Optim. 4 (1) (2007)
Adam N. Letchford, Andrea Lodi
The traveling salesman problem: a book review. 4OR 5 (4) (2007)
Monia Giandomenico, Adam N. Letchford
Exploring the Relationship Between Max-Cut and Stable Set Relaxations. Math. Program. 106 (1) (2006)
Adam N. Letchford, Dirk Oliver Theis
Odd minimum cut sets and b-matchings revisited. CoRR (2006)
Adam N. Letchford, Juan José Salazar González
Projection results for vehicle routing. Math. Program. 105 (2-3) (2006)
Lisa Fleischer, Adam N. Letchford, Andrea Lodi
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities. Math. Oper. Res. 31 (4) (2006)
Adam N. Letchford, Nicholas A. Pearson
A fast algorithm for minimum weight odd circuits and cuts in planar graphs. Oper. Res. Lett. 33 (6) (2005)
Jens Lysgaard, Adam N. Letchford, Richard W. Eglese
A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100 (2) (2004)
Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis
A Faster Exact Separation Algorithm for Blossom Inequalities. IPCO (2004)
Adam N. Letchford
Book review. Oper. Res. Lett. 32 (4) (2004)
Adam N. Letchford, Andrea Lodi
Primal separation algorithms. 4OR 1 (3) (2003)
Alberto Caprara, Adam N. Letchford
On the separation of split cuts and related inequalities. Math. Program. 94 (2-3) (2003)
Adam N. Letchford
Binary clutter inequalities for integer programs. Math. Program. 98 (1-3) (2003)

Adam N. Letchford.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Adam N. Letchford