The merchant subtour problem (Q1411616)

From MaRDI portal
Revision as of 19:38, 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
The merchant subtour problem
scientific article

    Statements

    title
    The merchant subtour problem (English)
    0 references
    author
    Bram Verweij
    0 references
    Karen Aardal
    0 references
    publication date
    29 October 2003
    0 references
    zbMATH Keywords
    tabu-search algorithm
    0 references
    branch-and-prince-and-cut algorithm
    0 references
    branch-and-bound tree
    0 references
    lifted knapsack inequalities
    0 references
    lifted cycle inequalities
    0 references
    mod-\(k\) cuts
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C27
    0 references
    90C35
    0 references
    90C57
    0 references
    zbMATH DE Number
    1998195
    0 references
    OpenAlex ID
    W2138087342
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1411616&oldid=38642132"
    Powered by MediaWiki