Some Working Papers by Adam N. Letchford

With S. Cáceres Gelvez & T.H. Dang: MIP-based local search for the permutation flowshop problem.
With T. Dokka & M.H. Mansoor: Using surrogate relaxation as a matheuristic.
With L. Galli: On an integer programming formulation for the multiple knapsack assignment problem.
With L. Galli & A. Gupte: Disjoint bilinear programs, facial disjunctions, and the reformulation-linearization technique.
With A. Kheiri & M. Randall: Insertion heuristics for a class of dynamic vehicle routing problems.
With A. Kheiri & M. Randall: On vehicle routing and slot offering in attended home delivery.
With F. Rossi & S. Smriglio: An ellipsoidal approach to quadratic unconstrained binary optimisation.
With M.M. Sørensen: The clique partitioning problem: semidefinite and spectral bounds.

Last update: August 2023.

Back to home page.

Adam N. Letchford