volume 12 issue 4 pages 529-568

A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation

Sahar Tahernejad 1
Ted K Ralphs 1
Scott T Denegre 2
Publication typeJournal Article
Publication date2020-06-26
scimago Q1
wos Q1
SJR1.351
CiteScore8.4
Impact factor3.6
ISSN18672949, 18672957
Software
Theoretical Computer Science
Abstract
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.
Found 
Found 

Top-30

Journals

2
4
6
8
10
12
INFORMS Journal on Computing
11 publications, 15.07%
European Journal of Operational Research
10 publications, 13.7%
Mathematical Programming
5 publications, 6.85%
Electric Power Systems Research
3 publications, 4.11%
Operations Research
2 publications, 2.74%
Journal of Global Optimization
2 publications, 2.74%
Mathematical Programming Computation
2 publications, 2.74%
SSRN Electronic Journal
2 publications, 2.74%
EURO Journal on Computational Optimization
2 publications, 2.74%
Transportation Research, Series B: Methodological
2 publications, 2.74%
Optimization Methods and Software
2 publications, 2.74%
Lecture Notes in Computer Science
2 publications, 2.74%
Computers and Operations Research
2 publications, 2.74%
Operations Research Letters
2 publications, 2.74%
Automation and Remote Control
2 publications, 2.74%
Arabian Journal for Science and Engineering
1 publication, 1.37%
Energy
1 publication, 1.37%
Engineering Applications of Artificial Intelligence
1 publication, 1.37%
Production and Operations Management
1 publication, 1.37%
Journal of the Operational Research Society
1 publication, 1.37%
Springer Optimization and Its Applications
1 publication, 1.37%
Soft Computing
1 publication, 1.37%
Annals of Operations Research
1 publication, 1.37%
Games and Economic Behavior
1 publication, 1.37%
Omega
1 publication, 1.37%
IEEE Transactions on Systems, Man, and Cybernetics: Systems
1 publication, 1.37%
Автоматика и телемеханика
1 publication, 1.37%
International Series in Operations Research and Management Science
1 publication, 1.37%
Computers and Electrical Engineering
1 publication, 1.37%
2
4
6
8
10
12

Publishers

5
10
15
20
25
30
Elsevier
27 publications, 36.99%
Springer Nature
19 publications, 26.03%
Institute for Operations Research and the Management Sciences (INFORMS)
13 publications, 17.81%
Taylor & Francis
3 publications, 4.11%
Institute of Electrical and Electronics Engineers (IEEE)
3 publications, 4.11%
The Russian Academy of Sciences
2 publications, 2.74%
Social Science Electronic Publishing
1 publication, 1.37%
SAGE
1 publication, 1.37%
Pleiades Publishing
1 publication, 1.37%
Cellule MathDoc/Centre Mersenne
1 publication, 1.37%
5
10
15
20
25
30
  • We do not take into account publications without a DOI.
  • Statistics recalculated weekly.

Are you a researcher?

Create a profile to get free access to personal recommendations for colleagues and new articles.
Metrics
73
Share
Cite this
GOST |
Cite this
GOST Copy
Tahernejad S., Ralphs T. K., Denegre S. T. A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation // Mathematical Programming Computation. 2020. Vol. 12. No. 4. pp. 529-568.
GOST all authors (up to 50) Copy
Tahernejad S., Ralphs T. K., Denegre S. T. A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation // Mathematical Programming Computation. 2020. Vol. 12. No. 4. pp. 529-568.
RIS |
Cite this
RIS Copy
TY - JOUR
DO - 10.1007/s12532-020-00183-6
UR - https://doi.org/10.1007/s12532-020-00183-6
TI - A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
T2 - Mathematical Programming Computation
AU - Tahernejad, Sahar
AU - Ralphs, Ted K
AU - Denegre, Scott T
PY - 2020
DA - 2020/06/26
PB - Springer Nature
SP - 529-568
IS - 4
VL - 12
SN - 1867-2949
SN - 1867-2957
ER -
BibTex |
Cite this
BibTex (up to 50 authors) Copy
@article{2020_Tahernejad,
author = {Sahar Tahernejad and Ted K Ralphs and Scott T Denegre},
title = {A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation},
journal = {Mathematical Programming Computation},
year = {2020},
volume = {12},
publisher = {Springer Nature},
month = {jun},
url = {https://doi.org/10.1007/s12532-020-00183-6},
number = {4},
pages = {529--568},
doi = {10.1007/s12532-020-00183-6}
}
MLA
Cite this
MLA Copy
Tahernejad, Sahar, et al. “A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation.” Mathematical Programming Computation, vol. 12, no. 4, Jun. 2020, pp. 529-568. https://doi.org/10.1007/s12532-020-00183-6.