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

Uloženo v:
Podrobná bibliografie
Vydáno v:Operations research letters Ročník 44; číslo 6; s. 702 - 705
Hlavní autoři: Yang, Mei-Jia, Xia, Yong, Zou, Hui-Min
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.11.2016
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 performance for globally solving (BBQP).
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2016.09.002