Adam N. Letchford

Adam N. Letchford

Lancaster University

H-index: 34

Europe-United Kingdom

About Adam N. Letchford

Adam N. Letchford, With an exceptional h-index of 34 and a recent h-index of 20 (since 2020), a distinguished researcher at Lancaster University, specializes in the field of Combinatorial Optimisation, Integer Programming.

His recent articles reflect a diverse array of research interests and contributions to the field:

Improving a constructive heuristic for the general routing problem

Fast upper and lower bounds for a large-scale real-world arc routing problem

Newsvendor problems: An integrated method for estimation and optimisation

A cut-and-branch algorithm for the quadratic knapsack problem

Generalised 2-circulant inequalities for the max-cut problem

On matchings, T‐joins, and arc routing in road networks

Revisiting surrogate relaxation for the multidimensional knapsack problem

Vehicle routing on road networks: How good is Euclidean approximation?

Adam N. Letchford Information

University

Position

Professor of Optimisation

Citations(all)

4598

Citations(since 2020)

1813

Cited By

3582

hIndex(all)

34

hIndex(since 2020)

20

i10Index(all)

70

i10Index(since 2020)

38

Email

University Profile Page

Google Scholar

Adam N. Letchford Skills & Research Interests

Combinatorial Optimisation

Integer Programming

Top articles of Adam N. Letchford

Title

Journal

Author(s)

Publication Date

Improving a constructive heuristic for the general routing problem

Networks

Burak Boyacı

Thu Huong Dang

Adam N Letchford

2023/1

Fast upper and lower bounds for a large-scale real-world arc routing problem

Networks

Burak Boyacı

Thu Huong Dang

Adam N Letchford

2023/1/1

Newsvendor problems: An integrated method for estimation and optimisation

European Journal of Operational Research

Congzheng Liu

Adam N Letchford

Ivan Svetunkov

2022/7/16

A cut-and-branch algorithm for the quadratic knapsack problem

Discrete Optimization

Franklin Djeumou Fomeni

Konstantinos Kaparis

Adam N Letchford

2022/5/1

Generalised 2-circulant inequalities for the max-cut problem

Operations Research Letters

Konstantinos Kaparis

Adam N Letchford

Ioannis Mourtos

2022/3/1

On matchings, T‐joins, and arc routing in road networks

Networks

Burak Boyacı

Thu Huong Dang

Adam N Letchford

2022/1

Revisiting surrogate relaxation for the multidimensional knapsack problem

Operations Research Letters

Vikram Dokka

Adam N Letchford

M Hasan Mansoor

2022/9

Vehicle routing on road networks: How good is Euclidean approximation?

Computers & Operations Research

Burak Boyacı

Thu Huong Dang

Adam N Letchford

2021/5/1

Valid inequalities for quadratic optimisation with domain constraints

Discrete Optimization

Laura Galli

Adam N Letchford

2021/8/1

Facets from gadgets

Mathematical Programming

Adam N Letchford

Anh N Vu

2021/1

A separation algorithm for the simple plant location problem

Operations Research Letters

Laura Galli

Adam N Letchford

2021/6/23

Strengthened clique-family inequalities for the stable set polytope

Operations Research Letters

Adam N Letchford

Paolo Ventura

2021/6/15

On the complexity of surrogate and group relaxation for integer linear programs

Operations Research Letters

Trivikram Dokka

Adam N Letchford

M Hasan Mansoor

2021/5/31

Bi-perspective functions for mixed-integer fractional programs with indicator variables

Mathematical Programming

Adam N Letchford

Qiang Ni

Zhaoyu Zhong

2021/10/1

Using ℓp-norms for fairness in combinatorial optimisation

Computers & Operations Research

Tolga Bektaş

Adam N Letchford

2020/8/1

Adaptive policies for perimeter surveillance problems

European Journal of Operational Research

James A Grant

David S Leslie

Kevin Glazebrook

Roberto Szechtman

Adam Letchford

2020

Valid inequalities for mixed-integer programmes with fixed charges on sets of variables

Operations Research Letters

Adam N Letchford

Georgia Souli

2020/5/1

The stable set problem: Clique and nodal inequalities revisited

Computers & Operations Research

Adam N Letchford

Fabrizio Rossi

Stefano Smriglio

2020/11/1

A heuristic for fair dynamic resource allocation in overloaded OFDMA systems

Journal of Heuristics

Adam N Letchford

Qiang Ni

Zhaoyu Zhong

2020/2

On matroid parity and matching polytopes

Discrete Applied Mathematics

Konstantinos Kaparis

Adam N Letchford

Ioannis Mourtos

2020/4/10

See List of Professors in Adam N. Letchford University(Lancaster University)

Co-Authors

academic-engine