- -

An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming

Show full item record

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

Files in this item

Item Metadata

Title: An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming
Author:
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: Mixed-integer bi-level programming , Branch and cut method , Fathoming branch
Copyrigths: Reconocimiento - No comercial (by-nc)
Source:
International Journal of Production Management and Engineering. (issn: 2340-5317 ) (eissn: 2340-4876 )
DOI: 10.4995/ijpme.2017.6512
Publisher:
Universitat Politècnica de València
Publisher version: https://doi.org/10.4995/ijpme.2017.6512
Type: Artículo

This item appears in the following Collection(s)

Show full item record