A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
From MaRDI portal
Publication:643005
DOI10.1016/j.dam.2010.08.028zbMath1229.90113OpenAlexW2091457806MaRDI QIDQ643005
Publication date: 27 October 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.08.028
Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20)
Related Items (4)
Complexity and Polynomially Solvable Special Cases of QUBO ⋮ A class of spectral bounds for max \(k\)-cut ⋮ Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems ⋮ Productivity improvement by reduction of idle time through application of queuing theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- The cut polytope and the Boolean quadric polytope
- Reverse search for enumeration
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- Via Minimization with Pin Preassignments and Layer Preference
- Constructing Arrangements of Lines and Hyperplanes with Applications
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Minimum cuts and related problems
- Lectures on Polytopes
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Systems of distinct representatives and linear algebra
- A polynomial case of unconstrained zero-one quadratic optimization
This page was built for publication: A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
