- -

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

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

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

Mostrar el registro completo del ítem

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

Ficheros en el ítem

Metadatos del ítem

Título: An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming
Autor:
Fecha difusión:
Resumen:
[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 ...[+]
Palabras clave: Mixed-integer bi-level programming , Branch and cut method , Fathoming branch
Derechos de uso: Reconocimiento - No comercial (by-nc)
Fuente:
International Journal of Production Management and Engineering. (issn: 2340-5317 ) (eissn: 2340-4876 )
DOI: 10.4995/ijpme.2017.6512
Editorial:
Universitat Politècnica de València
Versión del editor: https://doi.org/10.4995/ijpme.2017.6512
Tipo: Artículo

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro completo del ítem