On linearization techniques for budget-constrained binary quadratic programming problems

DOI10.1016/J.ORL.2016.09.002MaRDI QIDQ1709935zbMATH OpenOpenAlexFDO

Authors Mei-Jia Yang, Yong Xia, Hui-Min Zou

Publication date 15 January 2019

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2016.09.002

zbMATH Keywords

linearizationbinary quadratic programmingbudget constraintlinear programming relaxation

Mathematics Subject Classification ID

Quadratic programming (90C20) Integer programming (90C10) Boolean programming (90C09)

Recommendations

• Theoretical and computational study of several linearisation techniques for binary quadratic problems
• A linearization technique for quadratic integer programming with box constraint
• A linearization framework for unconstrained quadratic (0-1) problems
• A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
• Compact linearization for binary quadratic problems

Cites work

• scientific article; zbMATH DE number 849075 (Why is no real title available?)
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• A new linearization method for quadratic assignment problems
• A new linearization technique for multi-quadratic 0-1 programming problems.
• An improved linearization strategy for zero-one quadratic programming problems
• An improved linearization technique for a class of quadratic 0-1 programming problems
• Construction of test problems in quadratic bivalent programming
• Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Introduction to global optimization.
• Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
• Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• The dense \(k\)-subgraph problem
• The discrete p-dispersion problem
• Upper bounds and exact algorithms for \(p\)-dispersion problems

Cited in

(4)

• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
• Theoretical and computational study of several linearisation techniques for binary quadratic problems
• Compact linearization for binary quadratic problems subject to assignment constraints
• Inductive linearization for binary quadratic programs with linear constraints

This page was built for publication: On linearization techniques for budget-constrained binary quadratic programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709935)