On linearization techniques for budget-constrained binary quadratic programming problems

Glover’s linearization technique is revisited for solving the binary quadratic programming problem with a budget constraint (BBQP). When compared with the recent two linearizations for (BBQP), it not only provides a tighter relaxation at the root node, but also has a much better computational perfor...

Celý popis

Podrobná bibliografia

Vydané v:	Operations research letters Ročník 44; číslo 6; s. 702 - 705
Hlavní autori:	Yang, Mei-Jia, Xia, Yong, Zou, Hui-Min
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.11.2016
Predmet:	Binary quadratic programming Budget constraint Linear programming relaxation Linearization Binary quadratic programming Linear programming relaxation Budget constraint Linearization
ISSN:	0167-6377, 1872-7468
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!