The following pages link to Adam N. Letchford (Q185370):
Displaying 18 items.
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- The Steiner travelling salesman problem with correlated costs (Q319524) (← links)
- Primal cutting plane algorithms revisited (Q1396918) (← links)
- On the separation of split cuts and related inequalities (Q1411614) (← links)
- Fast bounding procedures for large instances of the simple plant location problem (Q1762067) (← links)
- The general routing polyhedron: A unifying framework (Q1806888) (← links)
- A new branch-and-cut algorithm for the capacitated vehicle routing problem (Q1881569) (← links)
- On the separation of maximally violated mod-\(k\) cuts (Q1970294) (← links)
- A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
- Decorous Lower Bounds for Minimum Linear Arrangement (Q2899100) (← links)
- A Dynamic Programming Heuristic for the Quadratic Knapsack Problem (Q2967622) (← links)
- A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
- Polynomial-Time Separation of a Superclass of Simple Comb Inequalities (Q5388004) (← links)
- Operational Research: Methods and Applications (Q6509328) (← links)
