Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118)

From MaRDI portal
Revision as of 02:18, 21 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60395659, #quickstatements; #temporary_batch_1710979808849)
scientific article
Language Label Description Also known as
English
Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem
scientific article

    Statements

    Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    12 February 2010
    0 references
    0-1 quadratic knapsack problem
    0 references
    linearization
    0 references

    Identifiers