An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions

We present an exact algorithm for the bilevel mixed integer linear programming (BMILP) problem under three simplifying assumptions. Although BMILP has been studied for decades and widely applied to various real world problems, there are only a few BMILP algorithms. Compared to these existing ones, o...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research Jg. 41; S. 309 - 318
Hauptverfasser:	Xu, Pan, Wang, Lizhi
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Elsevier Ltd 01.01.2014 Pergamon Press Inc
Schlagworte:	Algorithms Bilevel mixed integer linear programming Bilevel optimization Branch-and-bound Integer programming Libraries Linear programming Mathematical analysis Mathematical problems Mixed integer Online Operations research Optimization Optimization algorithms Studies Branch-and-bound Bilevel optimization Bilevel mixed integer linear programming
ISSN:	0305-0548, 1873-765X, 0305-0548
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!