Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
by
Monaci, Michele
, Sinnl, Markus
, Ljubić, Ivana
, Fischetti, Matteo
in
Algorithms
/ bilevel optimization
/ branch and cut
/ computational analysis
/ Computer Science
/ Continuity (mathematics)
/ cutting planes
/ Decision-making
/ Defense programs
/ Exact solutions
/ Innovations
/ Integer programming
/ intersection cuts
/ Machine learning
/ Mathematical optimization
/ Methods
/ Mixed integer
/ mixed-integer programming
/ Operations Research
/ Optimization
/ Optimization models
/ Routing
/ Transportation networks
2017
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
by
Monaci, Michele
, Sinnl, Markus
, Ljubić, Ivana
, Fischetti, Matteo
in
Algorithms
/ bilevel optimization
/ branch and cut
/ computational analysis
/ Computer Science
/ Continuity (mathematics)
/ cutting planes
/ Decision-making
/ Defense programs
/ Exact solutions
/ Innovations
/ Integer programming
/ intersection cuts
/ Machine learning
/ Mathematical optimization
/ Methods
/ Mixed integer
/ mixed-integer programming
/ Operations Research
/ Optimization
/ Optimization models
/ Routing
/ Transportation networks
2017
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
by
Monaci, Michele
, Sinnl, Markus
, Ljubić, Ivana
, Fischetti, Matteo
in
Algorithms
/ bilevel optimization
/ branch and cut
/ computational analysis
/ Computer Science
/ Continuity (mathematics)
/ cutting planes
/ Decision-making
/ Defense programs
/ Exact solutions
/ Innovations
/ Integer programming
/ intersection cuts
/ Machine learning
/ Mathematical optimization
/ Methods
/ Mixed integer
/ mixed-integer programming
/ Operations Research
/ Optimization
/ Optimization models
/ Routing
/ Transportation networks
2017
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
Journal Article
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
2017
Request Book From Autostore
and Choose the Collection Method
Overview
Bilevel optimization problems are very challenging optimization models arising in many important practical contexts, including pricing mechanisms in the energy sector, airline and telecommunication industry, transportation networks, critical infrastructure defense, and machine learning. In this paper, we consider bilevel programs with continuous and discrete variables at both levels, with linear objectives and constraints (continuous upper level variables, if any, must not appear in the lower level problem). We propose a general-purpose branch-and-cut exact solution method based on several new classes of valid inequalities, which also exploits a very effective bilevel-specific preprocessing procedure. An extensive computational study is presented to evaluate the performance of various solution methods on a common testbed of more than 800 instances from the literature and 60 randomly generated instances. Our new algorithm consistently outperforms (often by a large margin) alternative state-of-the-art methods from the literature, including methods exploiting problem-specific information for special instance classes. In particular, it solves to optimality more than 300 previously unsolved instances from the literature. To foster research on this challenging topic, our solver is made publicly available online.
The online appendix is available at
https://doi.org/10.1287/opre.2017.1650
.
MBRLCatalogueRelatedBooks
Related Items
Related Items
This website uses cookies to ensure you get the best experience on our website.