A branch and bound algorithm for bi-level discrete network design problem (Q264253)

From MaRDI portal
Revision as of 16:19, 19 June 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 branch and bound algorithm for bi-level discrete network design problem
scientific article

    Statements

    A branch and bound algorithm for bi-level discrete network design problem (English)
    0 references
    0 references
    0 references
    31 March 2016
    0 references

    Identifiers