Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167066679 / rank
 
Normal rank

Revision as of 03:13, 20 March 2024

scientific article
Language Label Description Also known as
English
Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
scientific article

    Statements

    Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (English)
    0 references
    0 references
    0 references
    0 references
    19 November 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    quadratic 0-1 programming
    0 references
    linear reformulation
    0 references
    quadratic convex reformulation
    0 references
    0 references