New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141)

From MaRDI portal
Revision as of 01:29, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
scientific article

    Statements

    New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (English)
    0 references
    0 references
    15 October 2010
    0 references
    Miller-Tucker-Zemlin constraints
    0 references
    spanning trees
    0 references
    network flows
    0 references
    integer programming
    0 references
    hop constraints
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers