Valid inequalities and branch-and-cut for the clique pricing problem (Q665989)

From MaRDI portal
Revision as of 00:01, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Valid inequalities and branch-and-cut for the clique pricing problem
scientific article

    Statements

    Valid inequalities and branch-and-cut for the clique pricing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    network pricing
    0 references
    mixed integer programming
    0 references
    combinatorial optimization
    0 references
    clique
    0 references
    0 references