A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CSDP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDP_S / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57702144 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-013-0676-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064249866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints / 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: Extending the QCR method to general mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The MILP Road to MIQCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Lagrangian relaxation for general quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxation for nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On duality for Boolean programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:53, 8 July 2024

scientific article
Language Label Description Also known as
English
A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs
scientific article

    Statements

    A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (English)
    0 references
    0 references
    0 references
    30 April 2014
    0 references
    combinatorial optimization
    0 references
    semidefinite programming
    0 references
    quadratically constrained quadratic programming
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references