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 S. Cáceres Gelvez & T.H. Dang: Simple and sparse disjunctive cuts for the permutation flowshop 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: Cutting planes for the multiple knapsack assignment problem.
With L. Galli & A. Gupte: Disjoint bilinear programs, facial disjunctions, and the reformulation-linearization technique.
With K. Kaparis & I. Mourtos: A note on dense instances of the max-cut problem.
With K. Kaparis & I. Mourtos: On simple disjunctive cuts for the max-cut problem.
With A. Kheiri & M. Randall: Applying a sum-of-squares heuristic to the vehicle routing and slot offering problem in attended home delivery.
With C. Liu & I. Svetunkov: Naive newsvendor adjustments: are they always detrimental? (PDF)
With F. Rossi & S. Smriglio: An ellipsoidal approach to quadratic unconstrained binary optimisation.
With M.M. Sørensen: New facets for the clique partitioning problem.
With M.M. Sørensen: New separation algorithms for the clique partitioning problem.
With M.M. Sørensen: The clique partitioning problem: semidefinite and spectral bounds.

Last update: June 2024.

Back to home page.

Adam N. Letchford