SDP diagonalizations and perspective cuts for a class of nonseparable MIQP (Q2643791): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5688739 / 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: Perspective cuts for a class of convex 0-1 mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints / 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

Revision as of 13:18, 26 June 2024

scientific article
Language Label Description Also known as
English
SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
scientific article

    Statements

    SDP diagonalizations and perspective cuts for a class of nonseparable MIQP (English)
    0 references
    0 references
    0 references
    27 August 2007
    0 references
    mixed-integer quadratic programs
    0 references
    valid inequalities
    0 references
    semidefinite programming
    0 references
    portfolio optimization
    0 references

    Identifiers

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