TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer (Q1821039): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q101129207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(N log N) planar travelling salesman heuristic based on spacefilling curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing over the subtour polytope of the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank

Latest revision as of 18:19, 17 June 2024

scientific article
Language Label Description Also known as
English
TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer
scientific article

    Statements

    TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer (English)
    0 references
    1987
    0 references
    This note introduces TRAVEL, a software package designed to produce probably good solutions to the travelling salesman problem. The system is menu driven, allows the user to choose among various methods and features animated graphics displays of these procedures as they are running.
    0 references
    heuristics
    0 references
    relaxations
    0 references
    animated graphics
    0 references
    personal computer
    0 references
    TRAVEL
    0 references
    software
    0 references
    travelling salesman
    0 references
    0 references
    0 references
    0 references

    Identifiers