[PDF][PDF] Mixed-Integer Bilevel Optimization with Nonconvex Quadratic Lower-Level Problems: Complexity and a Solution Method
I Bomze, A Horländer, M Schmidt - 2024 - optimization-online.org
We study bilevel problems with a convex quadratic mixed-integer upper-level and a
nonconvex quadratic, purely continuous lower-level problem. We prove Σ2 p-hardness of …
nonconvex quadratic, purely continuous lower-level problem. We prove Σ2 p-hardness of …
[PDF][PDF] A Single-Level Reformulation of Integer Bilevel Programs using Decision Diagrams
SVL Lozano, WJ van Hoeve - andrew.cmu.edu
Integer bilevel programs are notoriously difficult to solve due to the absence of strong and
efficiently computable relaxations. In this work, we introduce a novel single-level …
efficiently computable relaxations. In this work, we introduce a novel single-level …