Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
scientific article

    Statements

    Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    6 December 2017
    0 references
    traveling salesman problem
    0 references
    distance constraint
    0 references
    integer linear programming
    0 references
    layered graph
    0 references
    branch-and-cut
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references