Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint (Q2883603)

From MaRDI portal
Revision as of 05:24, 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
Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint
scientific article

    Statements

    Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint (English)
    0 references
    0 references
    0 references
    0 references
    13 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    Steiner tree
    0 references
    MTZ subtour elimination constraints
    0 references
    reformulation-linearization technique
    0 references
    mixed integer programming
    0 references
    0 references