Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833)

From MaRDI portal
Revision as of 09:19, 7 July 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
Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
scientific article

    Statements

    Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (English)
    0 references
    0 references
    18 February 2014
    0 references
    0 references
    traveling salesman problem
    0 references
    branch-and-bound
    0 references
    branch-and-cut
    0 references
    heuristical methods
    0 references
    exact methods
    0 references
    bioinformatics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references