Convex reformulation for binary quadratic programming problems via average objective value maximization (Q2018868): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q489090
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Xiao-ling Guo / rank
 
Normal rank
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/s11590-014-0768-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2147198066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the copositive representation of binary and continuous nonconvex quadratic programs / 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: 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: An improved lower bound and approximation algorithm for binary constrained quadratic programming problem / 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: Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMA / 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: Convex Relaxations of (0, 1)-Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On duality gap in binary quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank

Latest revision as of 21:15, 9 July 2024

scientific article
Language Label Description Also known as
English
Convex reformulation for binary quadratic programming problems via average objective value maximization
scientific article

    Statements

    Convex reformulation for binary quadratic programming problems via average objective value maximization (English)
    0 references
    0 references
    0 references
    25 March 2015
    0 references
    binary quadratic programming
    0 references
    lower bounds
    0 references
    branch-and-bound
    0 references
    convex reformulation
    0 references

    Identifiers