Bivalent quadratic programming problem - A computational study
From MaRDI portal
Consider the problem of minimizing a quadratic function of n zero-one variables, i.e. minimize \(x^ tQx\), subject to \(x\in B^ n_ 2\), where Q is an \(n\times n\) symmetric matrix and \(B_ 2=\{0,1\}\). A branch-and- bound algorithm is proposed. Problems which are difficult to solve by this method are identified and a heuristic algorithm for their solution is suggested. Computational experience relating to the effectiveness of the two algorithms is indicated.
Recommendations
- Unconstrained quadratic bivalent programming problem
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- An algorithm for quadratic zero-one programs
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Quadratic optimization in 0-1 variables
Cited in
(18)- A solvable case of quadratic 0-1 programming
- QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- A continuous approch for globally solving linearly constrained quadratic
- Quadratic optimization in 0-1 variables
- An algorithm for quadratic zero-one programs
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- scientific article; zbMATH DE number 1199854 (Why is no real title available?)
- Extreme point Quadratic Minimization Problem
- Remarks on a difficult test problem for quadratic boolean programming
- Construction of test problems in quadratic bivalent programming
- scientific article; zbMATH DE number 1775264 (Why is no real title available?)
- The necessary conditions and the algorithm for a special class of 0-1 quadratic programming problem
- A Decomposition Method for Quadratic Zero-One Programming
- scientific article; zbMATH DE number 3314879 (Why is no real title available?)
- Discretization of a matrix in quadratic functional binary optimization
- Unconstrained quadratic bivalent programming problem
- A new branch and bound method with pretreatment for the binary quadratic programming
This page was built for publication: Bivalent quadratic programming problem - A computational study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801811)
