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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 41; s. 309 - 318
Hlavní autoři:	Xu, Pan, Wang, Lizhi
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.01.2014 Pergamon Press Inc
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!