A strong flow-based formulation for the shortest path problem in digraphs with negative cycles (Q3184586)

From MaRDI portal
Revision as of 20:19, 1 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A strong flow-based formulation for the shortest path problem in digraphs with negative cycles
scientific article

    Statements

    A strong flow-based formulation for the shortest path problem in digraphs with negative cycles (English)
    0 references
    0 references
    0 references
    0 references
    21 October 2009
    0 references
    linear programming
    0 references
    digraphs
    0 references
    shortest path
    0 references

    Identifiers