Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618)

From MaRDI portal
Revision as of 10:39, 27 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
scientific article

    Statements

    Cut-and-solve: An iterative search strategy for combinatorial optimization problems (English)
    0 references
    0 references
    0 references
    23 October 2007
    0 references
    search strategies
    0 references
    branch-and-bound
    0 references
    branch-and-cut
    0 references
    anytime algorithms
    0 references
    linear programming
    0 references
    traveling Salesman problem
    0 references

    Identifiers

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