Some Working Papers by Adam N. Letchford

With T.H. Dang & L. Durrell: A clustered Lagrangian approach to the simple plant location problem.
With T.H. Dang & L. Durrell: A stronger Lagrangian relaxation for the capacitated facility location problem.
With T. Dokka & M.H. Mansoor: Combinatorial optimisation: primal degeneracy affects dual-based heuristics.
With T. Dokka & M.H. Mansoor: Using surrogate relaxation as a matheuristic.
With L. Galli: Exploiting item dominance in knapsack problems.
With L. Galli: Computing bounds for the multiple knapsack assignment problem with integer programming.
With L. Galli: Solving the multiple knapsack assignment problem with Benders decomposition and cutting planes.
With L. Galli & A. Gupte: Disjoint bilinear programs, facial disjunctions, and the reformulation-linearization technique.
With K. Kaparis & I. Mourtos: On simple disjunctive cuts for the max-cut problem.
With K. Kaparis & I. Mourtos: A note on dense instances of the max-cut problem.
With A. Kheiri & M. Randall: Insertion heuristics for a dynamic vehicle routing problem.
With C. Liu & I. Svetunkov: Naive newsvendor adjustments: are they always detrimental?
With J. Lysgaard: A note on branch-and-price algorithms with MIP-based pricing.
With F. Rossi & S. Smriglio: An ellipsoidal approach to quadratic unconstrained binary optimisation.
With M.M. Sørensen: The clique partitioning problem: an analysis of separation algorithms based on odd cycles.
With M.M. Sørensen: The clique partitioning problem: semidefinite and spectral bounds.

Last update: September 2026.

Back to home page.

Adam N. Letchford