On linearization techniques for budget-constrained binary quadratic programming problems

DOI10.1016/j.orl.2016.09.002zbMath1408.90192OpenAlexW2518730482MaRDI QIDQ1709935

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

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

linearizationlinear programming relaxationbudget constraintbinary quadratic programming

Mathematics Subject Classification ID

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

Related Items (1)

An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating

Cites Work

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

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