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 | 149 | 2008 |
Separation algorithms for 0-1 knapsack polytopes K Kaparis, AN Letchford Mathematical programming 124, 69-91, 2010 | 120 | 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 | 73 | 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 | 53 | 2008 |
A cut-and-branch algorithm for the quadratic knapsack problem FD Fomeni, K Kaparis, AN Letchford Discrete Optimization 44, 100579, 2022 | 23 | 2022 |
Gap inequalities for non-convex mixed-integer quadratic programs L Galli, K Kaparis, AN Letchford Operations research letters 39 (5), 297-300, 2011 | 22 | 2011 |
Operations research in the space industry J Fliege, K Kaparis, B Khosravi European Journal of Operational Research 217 (2), 233-240, 2012 | 21 | 2012 |
Analysis, prioritization and strategic planning of flood mitigation projects based on sustainability dimensions and a spatial/value AHP-GIS system MT Aidinidou, K Kaparis, AC Georgiou Expert Systems with Applications 211, 118566, 2023 | 20 | 2023 |
Cutting planes for RLT relaxations of mixed 0–1 polynomial programs FD Fomeni, K Kaparis, AN Letchford Mathematical Programming 151, 639-658, 2015 | 14* | 2015 |
Cover inequalities K Kaparis, AN Letchford Wiley Encyclopedia of Operations Research and Management Science, 2010 | 14 | 2010 |
A cut-and-branch algorithm for the quadratic knapsack problem FD Fomeni, K Kaparis, AN Letchford tech. rep., Lancaster University Management School, UK, 2014 | 7 | 2014 |
Cutting planes for RLT relaxations of mixed 0–1 polynomial programs F Djeumou Fomeni, K Kaparis, A Letchford Mathematical Programming 151 (2), 639-658, 2015 | 5 | 2015 |
On laminar matroids and b-matchings K Kaparis, A Letchford submitted for publication, 2014 | 5 | 2014 |
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 | 5 | 2012 |
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 | 4 | 2012 |
A note on the 2-circulant inequalities for the max-cut problem K Kaparis, AN Letchford Operations Research Letters 46 (4), 443-447, 2018 | 3 | 2018 |
A Stochastic Bilevel DEA-Based Model for Resource Allocation EM Vretta, K Bitsis, K Kaparis, G Paltayian, AC Georgiou Computer Sciences & Mathematics Forum 7 (1), 40, 2023 | 2 | 2023 |
Supply chain forecasting for the UK Chinook fleet M Downing, M Chipulu, U Ojiako, K Kaparis OR insight 24 (2), 110-130, 2011 | 2 | 2011 |
A cut-andbranch algorithm for the multidimensional knapsack problem K Kaparis, AN Letchford Lancaster University, 2005 | 2 | 2005 |
Generalised 2-circulant inequalities for the max-cut problem K Kaparis, AN Letchford, I Mourtos Operations Research Letters 50 (2), 122-128, 2022 | 1 | 2022 |