A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for the capacitated profitable tour problem
scientific article

    Statements

    A branch-and-cut algorithm for the capacitated profitable tour problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 April 2015
    0 references
    branch-and-cut algorithm
    0 references
    valid inequalities
    0 references
    profitable tour problem
    0 references
    capacitated shortest path problem
    0 references
    traveling salesman problem
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers