Identification of non-optimal arcs for the traveling salesman problem (Q1165781): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3214706 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation / rank | |||
Normal rank | |||
Latest revision as of 15:05, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Identification of non-optimal arcs for the traveling salesman problem |
scientific article |
Statements
Identification of non-optimal arcs for the traveling salesman problem (English)
0 references
1982
0 references
traveling salesman problem
0 references
3-optimality
0 references
non-optimal arcs
0 references
elimination of arcs
0 references
0 references
