Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem (Q5684831)

From MaRDI portal
Revision as of 21:29, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3420485
Language Label Description Also known as
English
Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem
scientific article; zbMATH DE number 3420485

    Statements

    title
    Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem (English)
    0 references
    author
    Robert Garfinkel
    0 references
    publication date
    1973
    0 references

    Identifiers

    DOI
    10.1287/opre.21.1.340
    0 references
    zbMATH DE Number
    3420485
    0 references
    OpenAlex ID
    W2035850032
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5684831&oldid=31980276"
    Powered by MediaWiki