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

Full description

Saved in:
Bibliographic Details
Published in:Operations research letters Vol. 44; no. 6; pp. 702 - 705
Main Authors: Yang, Mei-Jia, Xia, Yong, Zou, Hui-Min
Format: Journal Article
Language:English
Published: Elsevier B.V 01.11.2016
Subjects:
Binary quadratic programming
Budget constraint
Linear programming relaxation
Linearization
Binary quadratic programming
Linear programming relaxation
Budget constraint
Linearization
ISSN:0167-6377, 1872-7468
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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