A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem (Q5002254)

From MaRDI portal
scientific article; zbMATH DE number 7375271
Language Label Description Also known as
English
A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem
scientific article; zbMATH DE number 7375271

    Statements

    A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem (English)
    0 references
    0 references
    0 references
    0 references
    27 July 2021
    0 references
    prize-collecting traveling salesman problem
    0 references
    MIP heuristics
    0 references
    branch-and-cut
    0 references

    Identifiers

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