Distance conserving reductions for nonoriented networks (Q594774): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4083324 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4174517 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the symmetric travelling salesman problem: Solution of a 120-city problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distance matrix of a graph and its realizability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Using cutting planes to solve the symmetric Travelling Salesman problem / rank | |||
Normal rank |
Latest revision as of 11:14, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Distance conserving reductions for nonoriented networks |
scientific article |
Statements
Distance conserving reductions for nonoriented networks (English)
0 references
1983
0 references
nonoriented network
0 references
travelling salesman
0 references
computational results
0 references
edge number reduction
0 references
0 references