期刊
MATHEMATICAL PROGRAMMING COMPUTATION
卷 12, 期 4, 页码 529-568出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s12532-020-00183-6
关键词
Bilevel optimization; Mixed integer optimization; Branch-and-cut algorithm; Open-source solver
类别
资金
- National Science Foundation [CMMI-1435453, CMMI-0728011, ACI-0102687]
In this paper, we describe a comprehensive algorithmic framework for solving mixed integer bilevel linear optimization problems (MIBLPs) using a generalized branch-and-cut approach. The framework presented merges features from existing algorithms (for both traditional mixed integer linear optimization and MIBLPs) with new techniques to produce a flexible and robust framework capable of solving a wide range of bilevel optimization problems. The framework has been fully implemented in the open-source solver MibS. The paper describes the algorithmic options offered by MibS and presents computational results evaluating the effectiveness of the various options for the solution of a number of classes of bilevel optimization problems from the literature.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据