Adam N. Letchford

120 papers B 6C 3Journal 109Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
An application of semi-Lagrangian relaxation to the generalised assignment problem.
Oper. Res. Lett.
Thu Huong Dang, Lauren Durrell, Adam N. Letchford
2026 J jnl
MIP-based local search for permutation flowshop scheduling with makespan objective.
Comput. Oper. Res.
Sebastian Cáceres Gelvez, Thu Huong Dang, Adam N. Letchford
2025 J jnl
New facets of the clique partitioning polytope.
Oper. Res. Lett.
Adam N. Letchford, Michael Malmros Sørensen
2024 J jnl
CP-Lib: Benchmark Instances of the Clique Partitioning Problem.
Math. Program. Comput.
Michael Malmros Sørensen, Adam N. Letchford
2024 J jnl
On a variant of the change-making problem.
Oper. Res. Lett.
Adam N. Letchford, Licong Cheng
2024 J jnl
On upper bounds for the multiple knapsack assignment problem.
Oper. Res. Lett.
Laura Galli, Adam N. Letchford
2024 J jnl
Operational Research: methods and applications.
J. Oper. Res. Soc.
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
2023 J jnl
A survey on exact algorithms for the maximum flow and minimum-cost flow problems.
Networks
Oliverio Cruz-Mejia, Adam N. Letchford
2023 J jnl
Fast upper and lower bounds for a large-scale real-world arc routing problem.
Networks
Burak Boyaci, Thu Huong Dang, Adam N. Letchford
2023 J jnl
Improving a constructive heuristic for the general routing problem.
Networks
Burak Boyaci, Thu Huong Dang, Adam N. Letchford
2023 J jnl
Matheuristics: survey and synthesis.
Int. Trans. Oper. Res.
Marco A. Boschetti, Adam N. Letchford, Vittorio Maniezzo
2023 J jnl
On cut polytopes and graph minors.
Discret. Optim.
Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos
2023 J jnl
On some lower bounds for the permutation flowshop problem.
Comput. Oper. Res.
Sebastian Cáceres Gelvez, Thu Huong Dang, Adam N. Letchford
2022 J jnl
A cut-and-branch algorithm for the Quadratic Knapsack Problem.
Discret. Optim.
Franklin Djeumou Fomeni, Konstantinos Kaparis, Adam N. Letchford
2022 J jnl
Generalised 2-circulant inequalities for the max-cut problem.
Oper. Res. Lett.
Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos
2022 J jnl
Newsvendor problems: An integrated method for estimation and optimisation.
Eur. J. Oper. Res.
Congzheng Liu, Adam N. Letchford, Ivan Svetunkov
2022 J jnl
On matchings, T-joins, and arc routing in road networks.
Networks
Burak Boyaci, Thu Huong Dang, Adam N. Letchford
2022 J jnl
Revisiting surrogate relaxation for the multidimensional knapsack problem.
Oper. Res. Lett.
Trivikram Dokka, Adam N. Letchford, Mohammad Hasan Mansoor
2021 J jnl
A separation algorithm for the simple plant location problem.
Oper. Res. Lett.
Laura Galli, Adam N. Letchford
2021 J jnl
Bi-perspective functions for mixed-integer fractional programs with indicator variables.
Math. Program.
Adam N. Letchford, Qiang Ni, Zhaoyu Zhong
2021 J jnl
Facets from gadgets.
Math. Program.
Adam N. Letchford, Anh N. Vu
2021 J jnl
On the complexity of surrogate and group relaxation for integer linear programs.
Oper. Res. Lett.
Trivikram Dokka, Adam N. Letchford, Mohammad Hasan Mansoor
2021 J jnl
Strengthened clique-family inequalities for the stable set polytope.
Oper. Res. Lett.
Adam N. Letchford, Paolo Ventura
2021 J jnl
Valid inequalities for quadratic optimisation with domain constraints.
Discret. Optim.
Laura Galli, Adam N. Letchford
2021 J jnl
Vehicle routing on road networks: How good is Euclidean approximation?
Comput. Oper. Res.
Burak Boyaci, Thu Huong Dang, Adam N. Letchford
2020 J jnl
A heuristic for fair dynamic resource allocation in overloaded OFDMA systems.
J. Heuristics
Adam N. Letchford, Qiang Ni, Zhaoyu Zhong
2020 J jnl
Adaptive policies for perimeter surveillance problems.
Eur. J. Oper. Res.
James A. Grant, David S. Leslie, Kevin Glazebrook, Roberto Szechtman, Adam N. Letchford
2020 J jnl
Lifting the knapsack cover inequalities for the knapsack polytope.
Oper. Res. Lett.
Adam N. Letchford, Georgia Souli
2020 J jnl
On matroid parity and matching polytopes.
Discret. Appl. Math.
Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos
2020 J jnl
The stable set problem: Clique and nodal inequalities revisited.
Comput. Oper. Res.
Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio
2020 J jnl
Using ℓ
Comput. Oper. Res.
Tolga Bektas, Adam N. Letchford
2020 J jnl
Valid inequalities for mixed-integer programmes with fixed charges on sets of variables.
Oper. Res. Lett.
Adam N. Letchford, Georgia Souli
2019 J jnl
New valid inequalities for the fixed-charge and single-node flow polytopes.
Oper. Res. Lett.
Adam N. Letchford, Georgia Souli
2019 J jnl
On lifted cover inequalities: A new lifting procedure with unusual properties.
Oper. Res. Lett.
Adam N. Letchford, Georgia Souli
2019 J jnl
The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time.
Eur. J. Oper. Res.
Adam N. Letchford, Juan José Salazar González
2018 C conf
A Heuristic for Maximising Energy Efficiency in an OFDMA System Subject to QoS Constraints.
ISCO
Adam N. Letchford, Qiang Ni, Zhaoyu Zhong
2018 J jnl
A binarisation heuristic for non-convex quadratic programming with box constraints.
Oper. Res. Lett.
Laura Galli, Adam N. Letchford
2018 J jnl
A guide to conic optimisation and its applications.
RAIRO Oper. Res.
Adam N. Letchford, Andrew J. Parkes
2018 J jnl
A note on the 2-circulant inequalities for the max-cut problem.
Oper. Res. Lett.
Konstantinos Kaparis, Adam N. Letchford
2018 J jnl
A two-level graph partitioning problem arising in mobile wireless communications.
Comput. Optim. Appl.
Jamie Fairbrother, Adam N. Letchford, Keith Briggs
2018 J jnl
Adaptive Policies for Perimeter Surveillance Problems.
CoRR
James A. Grant, David S. Leslie, Kevin Glazebrook, Roberto Szechtman, Adam N. Letchford
2018 J jnl
New valid inequalities and facets for the Simple Plant Location Problem.
Eur. J. Oper. Res.
Laura Galli, Adam N. Letchford, Sebastian J. Miller
2017 J jnl
A Two-Level Graph Partitioning Problem Arising in Mobile Wireless Communications.
CoRR
Jamie Fairbrother, Adam N. Letchford, Keith Briggs
2017 J jnl
A note on representations of linear inequalities in non-convex mixed-integer quadratic programs.
Oper. Res. Lett.
Adam N. Letchford, Daniel John Grainger
2017 J jnl
An exact algorithm for a resource allocation problem in mobile wireless communications.
Comput. Optim. Appl.
Adam N. Letchford, Qiang Ni, Zhaoyu Zhong
2017 J jnl
On the Lovász theta function and some variants.
Discret. Optim.
Laura Galli, Adam N. Letchford
2017 J jnl
Projection results for the -partition problem.
Discret. Optim.
Jamie Fairbrother, Adam N. Letchford
2016 C conf
Strengthening Chvátal-Gomory Cuts for the Stable Set Problem.
ISCO
Adam N. Letchford, Francesca Marzi, Fabrizio Rossi, Stefano Smriglio
2016 J jnl
Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem.
Eur. J. Oper. Res.
Adam N. Letchford, Juan José Salazar González
2015 J jnl
Cutting planes for RLT relaxations of mixed 0-1 polynomial programs.
Math. Program.
Franklin Djeumou Fomeni, Konstantinos Kaparis, Adam N. Letchford
2015 J jnl
Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms.
SIAM J. Optim.
Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio
2015 J jnl
Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem.
Eur. J. Oper. Res.
Adam N. Letchford, Juan José Salazar González
2015 J jnl
The 2013 Newton Institute Programme on polynomial optimization.
Math. Program.
Adam N. Letchford, Jean B. Lasserre, Pablo A. Parrilo, David Steurer
2015 J jnl
The Steiner travelling salesman problem with correlated costs.
Eur. J. Oper. Res.
Adam N. Letchford, Saeideh D. Nasiri
2014 J jnl
A Dynamic Programming Heuristic for the Quadratic Knapsack Problem.
INFORMS J. Comput.
Franklin Djeumou Fomeni, Adam N. Letchford
2014 J jnl
A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs.
Optim. Lett.
Laura Galli, Adam N. Letchford
2014 J jnl
A new separation algorithm for the Boolean quadric and cut polytopes.
Discret. Optim.
Adam N. Letchford, Michael Malmros Sørensen
2014 J jnl
An aggressive reduction scheme for the simple plant location problem.
Eur. J. Oper. Res.
Adam N. Letchford, Sebastian J. Miller
2014 J jnl
Iterated Chvátal-Gomory Cuts and the Geometry of Numbers.
SIAM J. Optim.
Iskander Aliev, Adam N. Letchford
2014 J jnl
Pricing routines for vehicle routing with time windows on road networks.
Comput. Oper. Res.
Adam N. Letchford, Saeideh D. Nasiri, Amar Oukil
2014 J jnl
Unbounded convex sets for non-convex mixed-integer quadratic programming.
Math. Program.
Samuel Burer, Adam N. Letchford
2013 J jnl
A polyhedral approach to the single row facility layout problem.
Math. Program.
André Renato Sales Amaral, Adam N. Letchford
2013 J jnl
Approximating the Lovász θ Function with the Subgradient Method.
Electron. Notes Discret. Math.
Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio
2013 J jnl
Compact formulations of the Steiner Traveling Salesman Problem and related problems.
Eur. J. Oper. Res.
Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis
2012 J jnl
Binary positive semidefinite matrices and associated integer polytopes.
Math. Program.
Adam N. Letchford, Michael Malmros Sørensen
2012 J jnl
Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems
CoRR
Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis
2012 J jnl
Complexity results for the gap inequalities for the max-cut problem.
Oper. Res. Lett.
Laura Galli, Konstantinos Kaparis, Adam N. Letchford
2012 J jnl
Fast bounding procedures for large instances of the Simple Plant Location Problem.
Comput. Oper. Res.
Adam N. Letchford, Sebastian J. Miller
2012 C conf
Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm.
ISCO
Laura Galli, Konstantinos Kaparis, Adam N. Letchford
2011 B conf
A New Approach to the Stable Set Problem Based on Ellipsoids.
IPCO
Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio
2011 J jnl
Computing compatible tours for the symmetric traveling salesman problem.
Math. Program. Comput.
Matteo Fortini, Adam N. Letchford, Andrea Lodi, Klaus Michael Wenger
2011 J jnl
Decorous Lower Bounds for Minimum Linear Arrangement.
INFORMS J. Comput.
Alberto Caprara, Adam N. Letchford, Juan José Salazar González
2011 J jnl
Gap inequalities for non-convex mixed-integer quadratic programs.
Oper. Res. Lett.
Laura Galli, Konstantinos Kaparis, Adam N. Letchford
2011 J jnl
Generalized network design polyhedra.
Networks
Corinne Feremans, Martine Labbé, Adam N. Letchford, Juan José Salazar González
2011 J jnl
On the membership problem for the {0, 1/2}-closure.
Oper. Res. Lett.
Adam N. Letchford, Sebastian Pokutta, Andreas S. Schulz
2010 B conf
Integer Quadratic Quasi-polyhedra.
IPCO
Adam N. Letchford
2010 J jnl
Lower Bounds for the Minimum Linear Arrangement of a Graph.
Electron. Notes Discret. Math.
Alberto Caprara, Adam N. Letchford, Juan José Salazar González
2010 J jnl
New techniques for cost sharing in combinatorial optimization games.
Math. Program.
Alberto Caprara, Adam N. Letchford
2010 J jnl
Separation algorithms for 0-1 knapsack polytopes.
Math. Program.
Konstantinos Kaparis, Adam N. Letchford
2010 J jnl
Small bipartite subgraph polytopes.
Oper. Res. Lett.
Laura Galli, Adam N. Letchford
2009 J jnl
An application of the Lovász-Schrijver
Math. Program.
Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio
2009 J jnl
Exploiting sparsity in pricing routines for the capacitated arc routing problem.
Comput. Oper. Res.
Adam N. Letchford, Amar Oukil
2009 — ch.
General Routing Problem.
Encyclopedia of Optimization
Richard W. Eglese, Adam N. Letchford
2009 J jnl
On Nonconvex Quadratic Programming with Box Constraints.
SIAM J. Optim.
Samuel Burer, Adam N. Letchford
2008 J jnl
A New Lower Bound for the Minimum Linear Arrangement of a Graph.
Electron. Notes Discret. Math.
André Renato Sales Amaral, Alberto Caprara, Adam N. Letchford, Juan José Salazar González
2008 B conf
Binary Positive Semidefinite Matrices and Associated Integer Polytopes.
IPCO
Adam N. Letchford, Michael Malmros Sørensen
2008 J jnl
Exploiting planarity in separation routines for the symmetric traveling salesman problem.
Discret. Optim.
Adam N. Letchford, Nicholas A. Pearson
2008 J jnl
Good triangulations yield good tours.
Comput. Oper. Res.
Adam N. Letchford, Nicholas A. Pearson
2008 J jnl
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem.
Eur. J. Oper. Res.
Konstantinos Kaparis, Adam N. Letchford
2008 J jnl
Odd Minimum Cut Sets and b-Matchings Revisited.
SIAM J. Discret. Math.
Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis
2008 J jnl
Preface.
Discret. Appl. Math.
Alistair R. Clark, Richard W. Eglese, Adam N. Letchford, Michael B. Wright
2007 J jnl
A branch-and-cut algorithm for the capacitated open vehicle routing problem.
J. Oper. Res. Soc.
Adam N. Letchford, Jens Lysgaard, Richard W. Eglese
2007 J jnl
Mixed integer programming.
Discret. Optim.
Jon Lee, Adam N. Letchford
2007 J jnl
The traveling salesman problem: a book review.
4OR
Adam N. Letchford, Andrea Lodi
2006 J jnl
Exploring the Relationship Between Max-Cut and Stable Set Relaxations.
Math. Program.
Monia Giandomenico, Adam N. Letchford
2006 J jnl
Odd minimum cut sets and b-matchings revisited.
CoRR
Adam N. Letchford, Dirk Oliver Theis
2006 J jnl
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities.
Math. Oper. Res.
Lisa Fleischer, Adam N. Letchford, Andrea Lodi
2006 J jnl
Projection results for vehicle routing.
Math. Program.
Adam N. Letchford, Juan José Salazar González
2005 J jnl
A fast algorithm for minimum weight odd circuits and cuts in planar graphs.
Oper. Res. Lett.
Adam N. Letchford, Nicholas A. Pearson
2004 B conf
A Faster Exact Separation Algorithm for Blossom Inequalities.
IPCO
Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis
2004 J jnl
A new branch-and-cut algorithm for the capacitated vehicle routing problem.
Math. Program.
Jens Lysgaard, Adam N. Letchford, Richard W. Eglese
2004 J jnl
Book review.
Oper. Res. Lett.
Adam N. Letchford
2003 J jnl
Binary clutter inequalities for integer programs.
Math. Program.
Adam N. Letchford
2003 J jnl
On the separation of split cuts and related inequalities.
Math. Program.
Alberto Caprara, Adam N. Letchford
2003 J jnl
Primal separation algorithms.
4OR
Adam N. Letchford, Andrea Lodi
2002 J jnl
Approximation Algorithms.
J. Oper. Res. Soc.
Adam N. Letchford
2002 J jnl
Multistars, partial multistars and the capacitated vehicle routing problem.
Math. Program.
Adam N. Letchford, Richard W. Eglese, Jens Lysgaard
2002 B conf
Polynomial-Time Separation of Simple Comb Inequalities.
IPCO
Adam N. Letchford, Andrea Lodi
2002 J jnl
Primal cutting plane algorithms revisited.
Math. Methods Oper. Res.
Adam N. Letchford, Andrea Lodi
2002 J jnl
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts.
Oper. Res. Lett.
Adam N. Letchford, Andrea Lodi
2002 J jnl
Totally tight Chvátal-Gomory cuts.
Oper. Res. Lett.
Adam N. Letchford
2001 J jnl
A cutting plane algorithm for the General Routing Problem.
Math. Program.
Angel Corberán, Adam N. Letchford, José María Sanchis
2001 — conf
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming.
Combinatorial Optimization
Adam N. Letchford, Andrea Lodi
2001 J jnl
Analysis of upper bounds for the Pallet Loading Problem.
Eur. J. Oper. Res.
Adam N. Letchford, André Renato Sales Amaral
2001 J jnl
On Disjunctive Cuts for Combinatorial Optimization.
J. Comb. Optim.
Adam N. Letchford
2000 J jnl
On the separation of maximally violated mod-
Math. Program.
Alberto Caprara, Matteo Fischetti, Adam N. Letchford
2000 J jnl
Separating a Superclass of Comb Inequalities in Planar Graphs.
Math. Oper. Res.
Adam N. Letchford
1999 B conf
On the Separation of Maximally Violated mod-k Cuts.
IPCO
Alberto Caprara, Matteo Fischetti, Adam N. Letchford
1999 J jnl
The general routing polyhedron: A unifying framework.
Eur. J. Oper. Res.
Adam N. Letchford
1998 J jnl
The rural postman problem with deadline classes.
Eur. J. Oper. Res.
Adam N. Letchford, Richard W. Eglese