An improved lower bound and approximation algorithm for binary constrained quadratic programming problem (Q609569): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-009-9504-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152442947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial case of unconstrained zero-one quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical dual approach to solving 0-1 quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions and optimality criteria to box constrained nonconvex minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric nonlinearity: potential energy, complementary energy, and the gap function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally Robust Controllers for Multivariable Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Gap Between the Complex Structured Singular Value and Its Convex Upper Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on the unconstrained quadratic integer programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the gap between the quadratic integer programming problem and its semidefinite relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global extremal conditions for multi-integer quadratic programming / rank
 
Normal rank

Latest revision as of 13:31, 3 July 2024

scientific article
Language Label Description Also known as
English
An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
scientific article

    Statements

    An improved lower bound and approximation algorithm for binary constrained quadratic programming problem (English)
    0 references
    0 references
    0 references
    0 references
    1 December 2010
    0 references
    spectral decomposition
    0 references

    Identifiers