#### Filter Results:

- Full text PDF available (77)

#### Publication Year

1998

2019

- This year (15)
- Last 5 years (43)
- Last 10 years (72)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jens Lysgaard, Adam N. Letchford, Richard W. Eglese
- Math. Program.
- 2004

We present a new branch-and-cut algorithm for the capacitated vehicle routing problem (CVRP). The algorithm uses a variety of cutting planes, including capacity, framed capacity, generalizedâ€¦ (More)

- Alberto Caprara, Adam N. Letchford
- Math. Program.
- 2003

The split cuts of Cook, Kannan and Schrijver are general-purpose valid inequalities for integer programming which include a variety of other well-known cuts as special cases. To detect violated splitâ€¦ (More)

- Adam N. Letchford
- Math. Oper. Res.
- 2000

Many classes of valid and facet-inducing inequalities are known for the family of polytopes associated with the Symmetric Travelling Salesman Problem (STSP), including subtour elimination, 2-matchingâ€¦ (More)

A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex,â€¦ (More)

- Alberto Caprara, Matteo Fischetti, Adam N. Letchford
- Math. Program.
- 2000

Separation is of fundamental importance in cutting-plane based techniques for Integer Linear Programming (ILP). In recent decades, a considerable research effort has been devoted to the definition ofâ€¦ (More)

- Samuel Burer, Adam N. Letchford
- SIAM Journal on Optimization
- 2009

Nonconvex quadratic programming with box constraints is a fundamental NP-hard global optimization problem. Recently, some authors have studied a certain family of convex sets associated with thisâ€¦ (More)

- Konstantinos Kaparis, Adam N. Letchford
- Math. Program.
- 2010

Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms for them, i.e.,â€¦ (More)

- Adam N. Letchford, Richard W. Eglese, Jens Lysgaard
- Math. Program.
- 2002

- Adam N. Letchford, Andrea Lodi
- Oper. Res. Lett.
- 2002

Chv( atalâ€“Gomory and Gomory fractional cuts are well-known cutting planes for pure integer programming problems. Various methods for strengthening them are known, for example based on subadditiveâ€¦ (More)

- Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis
- European Journal of Operational Research
- 2013

The Steiner Traveling Salesman Problem (STSP) is a variant of the TSP that is particularly suitable when routing on real-life road networks. The standard integer programming formulations of both theâ€¦ (More)