Multi-product economic lot scheduling problem with separate production lines for manufacturing and remanufacturing R Teunter, K Kaparis, O Tang European journal of operational research 191 (3), 1241-1253, 2008 | 133 | 2008 |

Separation algorithms for 0-1 knapsack polytopes K Kaparis, AN Letchford Mathematical programming 124 (1), 69-91, 2010 | 96 | 2010 |

Heuristics for the economic lot scheduling problem with returns R Teunter, O Tang, K Kaparis International Journal of Production Economics 118 (1), 323-330, 2009 | 67 | 2009 |

Local and global lifted cover inequalities for the 0–1 multidimensional knapsack problem K Kaparis, AN Letchford European journal of operational research 186 (1), 91-103, 2008 | 48 | 2008 |

Gap inequalities for non-convex mixed-integer quadratic programs L Galli, K Kaparis, AN Letchford Operations research letters 39 (5), 297-300, 2011 | 19 | 2011 |

Operations research in the space industry J Fliege, K Kaparis, B Khosravi European Journal of Operational Research 217 (2), 233-240, 2012 | 18 | 2012 |

Cover inequalities K Kaparis, AN Letchford Wiley Encyclopedia of Operations Research and Management Science, 2010 | 15 | 2010 |

A cut-and-branch algorithm for the Quadratic Knapsack Problem FD Fomeni, K Kaparis, AN Letchford Discrete Optimization, 100579, 2020 | 13 | 2020 |

Cutting planes for RLT relaxations of mixed 0–1 polynomial programs FD Fomeni, K Kaparis, AN Letchford Mathematical Programming 151 (2), 639-658, 2015 | 13* | 2015 |

On laminar matroids and b-matchings K Kaparis, A Letchford submitted, 2014 | 5 | 2014 |

Complexity results for the gap inequalities for the max-cut problem L Galli, K Kaparis, AN Letchford Operations research letters 40 (3), 149-152, 2012 | 5 | 2012 |

Gap inequalities for the max-cut problem: a cutting-plane algorithm L Galli, K Kaparis, AN Letchford International Symposium on Combinatorial Optimization, 178-188, 2012 | 4 | 2012 |

A cut-and-branch algorithm for the multidimensional knapsack problem K Kaparis, A LETCHFORD Lancaster University. nov, 2005 | 3 | 2005 |

A note on the 2-circulant inequalities for the max-cut problem K Kaparis, AN Letchford Operations Research Letters 46 (4), 443-447, 2018 | 2 | 2018 |

On matroid parity and matching polytopes K Kaparis, AN Letchford, I Mourtos Discrete Applied Mathematics 284, 322-331, 2020 | 1 | 2020 |

Generalised 2-Circulant Inequalities for the Max-Cut Problem K Kaparis, AN Letchford, I Mourtos | | 2021 |

On Cut Polytopes and Graph Minors K Kaparis, AN Letchford, I Mourtos | | 2020 |

A cut-and-branch algorithm for the quadratic knapsack problem A Letchford, F Djeumou Fomeni, K Kaparis 17th British-French-German Optimisation Conference (BFG 2015), 2015 | | 2015 |

Strong First-Level RLT Relaxations of Mixed 0-1 Programs FD Fomeni, K Kaparis, AN Letchford Keynote Papers and Extended Abstracts, 12, 2013 | | 2013 |

A min-cost/max flow formulation for the s-metric normalisation on directed graphs K Kaparis, J Fliege Pre-print, 2010 | | 2010 |