A polynomial case of the cardinality-constrained quadratic optimization problem (Q2393087): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/jgo/GaoL13, #quickstatements; #temporary_batch_1731505720702
 
(One intermediate revision by one other user not shown)
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: Algorithm for cardinality-constrained quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of a family of mixed-integer quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for cardinality constrained portfolio optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinality Constrained Linear-Quadratic Optimal Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4806224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian relaxation procedure for cardinality-constrained portfolio optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4719331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic complexity: three<i>NP</i>- hard problems in computational statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5453757 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jgo/GaoL13 / rank
 
Normal rank

Latest revision as of 15:13, 13 November 2024

scientific article
Language Label Description Also known as
English
A polynomial case of the cardinality-constrained quadratic optimization problem
scientific article

    Statements

    A polynomial case of the cardinality-constrained quadratic optimization problem (English)
    0 references
    7 August 2013
    0 references
    cardinality-constrained quadratic optimization
    0 references
    cell enumeration
    0 references
    nonconvex optimization
    0 references
    fixed parameter polynomial algorithm
    0 references
    0 references
    0 references

    Identifiers