Narrow search
Showing 1 - 7 of 7
Cover Image
Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations
Buchheim, Christoph - In: Operations research letters 51 (2023) 6, pp. 618-622
Persistent link: https://www.econbiz.de/10014465872
Cover Image
Local cuts revisited
Buchheim, Christoph; Liers, Frauke; Oswald, Marcus - In: Operations research letters 36 (2008) 4, pp. 430-433
Persistent link: https://www.econbiz.de/10003786698
Cover Image
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
Buchheim, Christoph; De Santis, Marianna; Palagi, Laura - In: Operations research letters 43 (2015) 4, pp. 384-388
Persistent link: https://www.econbiz.de/10011372453
Cover Image
On the complexity of robust bilevel optimization with uncertain follower's objective
Buchheim, Christoph; Henke, Dorothee; Hommelsheim, Felix - In: Operations research letters 49 (2021) 5, pp. 703-707
Persistent link: https://www.econbiz.de/10013207431
Cover Image
Local cuts revisited
Buchheim, Christoph; Liers, Frauke; Oswald, Marcus - In: Operations research letters 36 (2008) 4, pp. 430-433
Persistent link: https://www.econbiz.de/10008077546
Cover Image
Local cuts revisited
Buchheim, Christoph; Liers, Frauke; Oswald, Marcus - In: Operations research letters 36 (2008) 4, pp. 430-434
Persistent link: https://www.econbiz.de/10008880060
Cover Image
Convex optimization under combinatorial sparsity constraints
Buchheim, Christoph; Traversi, Emiliano - In: Operations research letters 50 (2022) 6, pp. 632-638
Persistent link: https://www.econbiz.de/10014230140