On linearization techniques for budget-constrained binary quadratic programming problems
From MaRDI portal
Publication:1709935
DOI10.1016/J.ORL.2016.09.002zbMATH Open1408.90192OpenAlexW2518730482MaRDI QIDQ1709935FDOQ1709935
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
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
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- 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
- The dense \(k\)-subgraph problem
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Introduction to global optimization.
- The discrete p-dispersion problem
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- An improved linearization strategy for zero-one quadratic programming problems
- A new linearization method for quadratic assignment problems
- Title not available (Why is that?)
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
- A new linearization technique for multi-quadratic 0-1 programming problems.
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Construction of test problems in quadratic bivalent programming
- An improved linearization technique for a class of quadratic 0-1 programming problems
Cited In (4)
- 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
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
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)
