An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming
In this paper, a new branch-and-cut algorithm for mixed integer bi-level programming is proposed. For achieving this purpose, a historical perspective of the development of enumeration methods in the field of bi-level linear programming is considered. Then, we present some obstacles for using branch...
| Main Authors: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | English |
| Publicado em: |
Universitat Politècnica de València
2017-01-01
|
| Colecção: | International Journal of Production Management and Engineering |
| Assuntos: | |
| Acesso em linha: | http://polipapers.upv.es/index.php/IJPME/article/view/6512 |