Presolving linear bilevel optimization problems
Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization. Thus, during the last years and decades many branch-and-bound methods, cutting planes, or heu...
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
Elsevier
2021-01-01
|
| Collection: | EURO Journal on Computational Optimization |
| Sujets: | |
| Accès en ligne: | http://www.sciencedirect.com/science/article/pii/S2192440621001477 |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|