A Branch-and-Cut Approach to a Traveling Salesman Problem with Side Constraints (Q3471856)

From MaRDI portal
Revision as of 20:09, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A Branch-and-Cut Approach to a Traveling Salesman Problem with Side Constraints
scientific article

    Statements

    A Branch-and-Cut Approach to a Traveling Salesman Problem with Side Constraints (English)
    0 references
    1989
    0 references
    non-deterministic traveling salesman problem
    0 references
    heuristic
    0 references
    branch-and-cut
    0 references

    Identifiers

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