Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP) (Q2892348)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)
scientific article

    Statements

    Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP) (English)
    0 references
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    combinatorial optimization
    0 references
    traveling salesman
    0 references
    \texttt{TSPLIB}
    0 references
    cutting-plane algorithm
    0 references

    Identifiers