Some Working Papers
- 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. Durrell & T.H. Dang: An application of semi-Lagrangian relaxation
to the generalised assignment problem.
- With L. Galli: Non-standard Benders decomposition 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: 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: A sum-of-squares heuristic for dynamic
vehicle routing problems.
- 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: May 2025.
Back to home page.
Adam N. Letchford