Rahmani, A.; Yousefikhoshbakht, M. (2017). An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming. International Journal of Production Management and Engineering. 5(1):1-10. doi:10.4995/ijpme.2017.6512
Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/79743
Title: | An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming | |
Author: | Rahmani, Arsalan Yousefikhoshbakht, Majid | |
Issued date: |
|
|
Abstract: |
[EN] 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 ...[+]
|
|
Subjects: |
|
|
Copyrigths: | Reconocimiento - No comercial - Sin obra derivada (by-nc-nd) | |
Source: |
|
|
DOI: |
|
|
Publisher: |
|
|
Publisher version: | https://doi.org/10.4995/ijpme.2017.6512 | |
Type: |
|