Using cutting planes to solve the symmetric Travelling Salesman problem (Q4175048): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The Traveling Salesman Problem: A Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5645210 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem / 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: The traveling-salesman problem and minimum spanning trees: Part II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4404428 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5338603 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Integer programming approaches to the travelling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5661914 / rank | |||
Normal rank | |||
Latest revision as of 00:52, 13 June 2024
scientific article; zbMATH DE number 3611073
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using cutting planes to solve the symmetric Travelling Salesman problem |
scientific article; zbMATH DE number 3611073 |
Statements
Using cutting planes to solve the symmetric Travelling Salesman problem (English)
0 references
1978
0 references
Symmetric Travelling Salesman Problem
0 references
Cutting Planes
0 references
Combinatorial Problem
0 references
Computational Efficiency
0 references
