Adam N. Letchford

Affiliations:
  • Lancaster University, UK


According to our database1, Adam N. Letchford authored at least 101 papers between 1998 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Generalised 2-circulant inequalities for the max-cut problem.
Oper. Res. Lett., 2022

On matchings, T-joins, and arc routing in road networks.
Networks, 2022

Newsvendor problems: An integrated method for estimation and optimisation.
Eur. J. Oper. Res., 2022

2021
Strengthened clique-family inequalities for the stable set polytope.
Oper. Res. Lett., 2021

A separation algorithm for the simple plant location problem.
Oper. Res. Lett., 2021

On the complexity of surrogate and group relaxation for integer linear programs.
Oper. Res. Lett., 2021

Facets from gadgets.
Math. Program., 2021

Bi-perspective functions for mixed-integer fractional programs with indicator variables.
Math. Program., 2021

Valid inequalities for quadratic optimisation with domain constraints.
Discret. Optim., 2021

Vehicle routing on road networks: How good is Euclidean approximation?
Comput. Oper. Res., 2021

2020
Lifting the knapsack cover inequalities for the knapsack polytope.
Oper. Res. Lett., 2020

Valid inequalities for mixed-integer programmes with fixed charges on sets of variables.
Oper. Res. Lett., 2020

A heuristic for fair dynamic resource allocation in overloaded OFDMA systems.
J. Heuristics, 2020

Adaptive policies for perimeter surveillance problems.
Eur. J. Oper. Res., 2020

On matroid parity and matching polytopes.
Discret. Appl. Math., 2020

The stable set problem: Clique and nodal inequalities revisited.
Comput. Oper. Res., 2020

Using ℓ<sup><i>p</i></sup>-norms for fairness in combinatorial optimisation.
Comput. Oper. Res., 2020

2019
New valid inequalities for the fixed-charge and single-node flow polytopes.
Oper. Res. Lett., 2019

On lifted cover inequalities: A new lifting procedure with unusual properties.
Oper. Res. Lett., 2019

The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time.
Eur. J. Oper. Res., 2019

2018
A guide to conic optimisation and its applications.
RAIRO Oper. Res., 2018

A note on the 2-circulant inequalities for the max-cut problem.
Oper. Res. Lett., 2018

A binarisation heuristic for non-convex quadratic programming with box constraints.
Oper. Res. Lett., 2018

New valid inequalities and facets for the Simple Plant Location Problem.
Eur. J. Oper. Res., 2018

A two-level graph partitioning problem arising in mobile wireless communications.
Comput. Optim. Appl., 2018

A Heuristic for Maximising Energy Efficiency in an OFDMA System Subject to QoS Constraints.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017
A note on representations of linear inequalities in non-convex mixed-integer quadratic programs.
Oper. Res. Lett., 2017

On the Lovász theta function and some variants.
Discret. Optim., 2017

Projection results for the -partition problem.
Discret. Optim., 2017

An exact algorithm for a resource allocation problem in mobile wireless communications.
Comput. Optim. Appl., 2017

2016
Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem.
Eur. J. Oper. Res., 2016

Strengthening Chvátal-Gomory Cuts for the Stable Set Problem.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms.
SIAM J. Optim., 2015

The 2013 Newton Institute Programme on polynomial optimization.
Math. Program., 2015

Cutting planes for RLT relaxations of mixed 0-1 polynomial programs.
Math. Program., 2015

The Steiner travelling salesman problem with correlated costs.
Eur. J. Oper. Res., 2015

Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem.
Eur. J. Oper. Res., 2015

2014
Iterated Chvátal-Gomory Cuts and the Geometry of Numbers.
SIAM J. Optim., 2014

A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs.
Optim. Lett., 2014

Unbounded convex sets for non-convex mixed-integer quadratic programming.
Math. Program., 2014

A Dynamic Programming Heuristic for the Quadratic Knapsack Problem.
INFORMS J. Comput., 2014

An aggressive reduction scheme for the simple plant location problem.
Eur. J. Oper. Res., 2014

A new separation algorithm for the Boolean quadric and cut polytopes.
Discret. Optim., 2014

Pricing routines for vehicle routing with time windows on road networks.
Comput. Oper. Res., 2014

2013
A polyhedral approach to the single row facility layout problem.
Math. Program., 2013

Compact formulations of the Steiner Traveling Salesman Problem and related problems.
Eur. J. Oper. Res., 2013

Approximating the Lovász θ Function with the Subgradient Method.
Electron. Notes Discret. Math., 2013

2012
Complexity results for the gap inequalities for the max-cut problem.
Oper. Res. Lett., 2012

Binary positive semidefinite matrices and associated integer polytopes.
Math. Program., 2012

Fast bounding procedures for large instances of the Simple Plant Location Problem.
Comput. Oper. Res., 2012

Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
On the membership problem for the {0, 1/2}-closure.
Oper. Res. Lett., 2011

Gap inequalities for non-convex mixed-integer quadratic programs.
Oper. Res. Lett., 2011

Generalized network design polyhedra.
Networks, 2011

Computing compatible tours for the symmetric traveling salesman problem.
Math. Program. Comput., 2011

Decorous Lower Bounds for Minimum Linear Arrangement.
INFORMS J. Comput., 2011

A New Approach to the Stable Set Problem Based on Ellipsoids.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010
Small bipartite subgraph polytopes.
Oper. Res. Lett., 2010

Separation algorithms for 0-1 knapsack polytopes.
Math. Program., 2010

New techniques for cost sharing in combinatorial optimization games.
Math. Program., 2010

Lower Bounds for the Minimum Linear Arrangement of a Graph.
Electron. Notes Discret. Math., 2010

Integer Quadratic Quasi-polyhedra.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009
General Routing Problem.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

On Nonconvex Quadratic Programming with Box Constraints.
SIAM J. Optim., 2009

An application of the Lovász-Schrijver <i>M</i>(<i>K</i>, <i>K</i>) operator to the stable set problem.
Math. Program., 2009

Exploiting sparsity in pricing routines for the capacitated arc routing problem.
Comput. Oper. Res., 2009

2008
Odd Minimum Cut Sets and b-Matchings Revisited.
SIAM J. Discret. Math., 2008

Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem.
Eur. J. Oper. Res., 2008

A New Lower Bound for the Minimum Linear Arrangement of a Graph.
Electron. Notes Discret. Math., 2008

Exploiting planarity in separation routines for the symmetric traveling salesman problem.
Discret. Optim., 2008

Preface.
Discret. Appl. Math., 2008

Good triangulations yield good tours.
Comput. Oper. Res., 2008

2007
A branch-and-cut algorithm for the capacitated open vehicle routing problem.
J. Oper. Res. Soc., 2007

Mixed integer programming.
Discret. Optim., 2007

The traveling salesman problem: a book review.
4OR, 2007

2006
Projection results for vehicle routing.
Math. Program., 2006

Exploring the Relationship Between Max-Cut and Stable Set Relaxations.
Math. Program., 2006

Polynomial-Time Separation of a Superclass of Simple Comb Inequalities.
Math. Oper. Res., 2006

Odd minimum cut sets and b-matchings revisited.
CoRR, 2006

2005
A fast algorithm for minimum weight odd circuits and cuts in planar graphs.
Oper. Res. Lett., 2005

2004
Book review.
Oper. Res. Lett., 2004

A new branch-and-cut algorithm for the capacitated vehicle routing problem.
Math. Program., 2004

A Faster Exact Separation Algorithm for Blossom Inequalities.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003
Binary clutter inequalities for integer programs.
Math. Program., 2003

On the separation of split cuts and related inequalities.
Math. Program., 2003

Primal separation algorithms.
4OR, 2003

2002
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts.
Oper. Res. Lett., 2002

Totally tight Chvátal-Gomory cuts.
Oper. Res. Lett., 2002

Multistars, partial multistars and the capacitated vehicle routing problem.
Math. Program., 2002

Primal cutting plane algorithms revisited.
Math. Methods Oper. Res., 2002

Approximation Algorithms.
J. Oper. Res. Soc., 2002

Polynomial-Time Separation of Simple Comb Inequalities.
Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001
A cutting plane algorithm for the General Routing Problem.
Math. Program., 2001

On Disjunctive Cuts for Combinatorial Optimization.
J. Comb. Optim., 2001

Analysis of upper bounds for the Pallet Loading Problem.
Eur. J. Oper. Res., 2001

An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming.
Proceedings of the Combinatorial Optimization, 2001

2000
On the separation of maximally violated mod- <i>k</i> cuts.
Math. Program., 2000

Separating a Superclass of Comb Inequalities in Planar Graphs.
Math. Oper. Res., 2000

1999
The general routing polyhedron: A unifying framework.
Eur. J. Oper. Res., 1999

On the Separation of Maximally Violated mod-k Cuts.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998
The rural postman problem with deadline classes.
Eur. J. Oper. Res., 1998


  Loading...