☆ 4.4 Article

Complexity of near-optimal robust versions of multilevel optimization problems

OPTIMIZATION LETTERS (2021)

An enhanced branch-and-bound algorithm for bilevel integer linear programming

Shaonan Liu et al.

Summary: In this paper, an enhanced branch-and-bound algorithm is proposed for a class of BILP problems, which can significantly reduce computation time while maintaining solution quality. Computational studies show that the enhanced branching rule achieves significant speedup and superior performance on large-sized BILP instances with complex lower-level problems.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)

添加到收藏夹

Article Operations Research & Management Science

A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization

Thomas Kleinert et al.

Summary: Bilevel optimization is a mathematical programming field that models hierarchical decision-making processes but poses challenges in solving real-world problems. The interest in computational bilevel optimization has grown significantly in the past decade, with state-of-the-art solution approaches often relying on mixed-integer programming techniques. Research in this area dates back to the 1980s and continues to be actively explored today.

EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION (2021)

添加到收藏夹

Article Operations Research & Management Science