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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research letters Jg. 44; H. 6; S. 702 - 705
Hauptverfasser: Yang, Mei-Jia, Xia, Yong, Zou, Hui-Min
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.11.2016
Schlagworte:
Binary quadratic programming
Budget constraint
Linear programming relaxation
Linearization
Binary quadratic programming
Linear programming relaxation
Budget constraint
Linearization
ISSN:0167-6377, 1872-7468
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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