Items where Author is "Galli, Laura"

Journal Article

Galli, Laura and Letchford, Adam (2024) On upper bounds for the multiple knapsack assignment problem. Operations Research Letters, 54: 107104. ISSN 0167-6377

Galli, Laura and Letchford, Adam (2021) Valid inequalities for quadratic optimisation with domain constraints. Discrete Optimization, 41: 100661. ISSN 1572-5286

Galli, Laura and Letchford, Adam (2021) A separation algorithm for the simple plant location problem. Operations Research Letters, 49 (4). pp. 610-615. ISSN 0167-6377

Galli, Laura and Letchford, Adam Nicholas and Miller, Sebastian (2018) New valid inequalities and facets for the simple plant location problem. European Journal of Operational Research, 269 (3). pp. 824-833. ISSN 0377-2217

Galli, Laura and Letchford, Adam Nicholas (2018) A binarisation heuristic for non-convex quadratic programming with box constraints. Operations Research Letters, 46 (5). pp. 529-533. ISSN 0167-6377

Galli, Laura and Letchford, Adam Nicholas (2017) On the Lovász theta function and some variants. Discrete Optimization, 25. pp. 159-174. ISSN 1572-5286

Galli, Laura and Letchford, Adam (2014) A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs. Optimization Letters, 8 (4). pp. 1213-1224. ISSN 1862-4472

Galli, Laura and Kaparis, Konstantinos and Letchford, A N (2012) Complexity results for the gap inequalities for the max-cut problem. Operations Research Letters, 40 (3). pp. 149-152. ISSN 0167-6377

Galli, Laura and Kaparis, Konstantinos and Letchford, A N (2011) Gap inequalities for non-convex mixed-integer quadratic programs. Operations Research Letters, 39 (5). pp. 297-300. ISSN 0167-6377

Contribution in Book/Report/Proceedings

Galli, Laura and Kaparis, Konstantinos and Letchford, Adam (2012) Gap inequalities for the max-cut problem: a cutting-plane algorithm. In: Combinatorial Optimization : Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers. Lecture Notes in Computer Science . Springer, Berlin, pp. 178-188. ISBN 9783642321467