Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move (Q1357488)

From MaRDI portal
Revision as of 11:04, 19 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
scientific article

    Statements

    Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move (English)
    0 references
    0 references
    2 September 1997
    0 references
    4-opt moves
    0 references
    traveling salesman
    0 references
    acyclic shortest path model
    0 references

    Identifiers