Solving discrete linear bilevel optimization problems using the optimal value reformulation
From MaRDI portal
Publication:1675551
DOI10.1007/s10898-016-0478-5zbMath1408.90195MaRDI QIDQ1675551
Publication date: 2 November 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0478-5
90C10: Integer programming
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C26: Nonconvex programming, global optimization
90C29: Multi-objective and goal programming