A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem (Q3637400)

From MaRDI portal
Revision as of 09:26, 17 October 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-Cut Algorithm for the Undirected Traveling Purchaser Problem
scientific article

    Statements

    A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem (English)
    0 references
    9 July 2009
    0 references
    0 references