Bivalent quadratic programming problem - A computational study
From MaRDI portal
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
(15)- Unconstrained quadratic bivalent programming problem
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Quadratic optimization in 0-1 variables
- A continuous approch for globally solving linearly constrained quadratic
- scientific article; zbMATH DE number 1775264 (Why is no real title available?)
- Extreme point Quadratic Minimization Problem
- Construction of test problems in quadratic bivalent programming
- scientific article; zbMATH DE number 3314879 (Why is no real title available?)
- A new branch and bound method with pretreatment for the binary quadratic programming
- A Decomposition Method for Quadratic Zero-One Programming
- The necessary conditions and the algorithm for a special class of 0-1 quadratic programming problem
- Discretization of a matrix in quadratic functional binary optimization
- An algorithm for quadratic zero-one programs
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A solvable case of quadratic 0-1 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)
