An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs (Q1280545): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710496893715 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The traveling salesman problem: An overview of exact and approximate algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3677509 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem / rank | |||
Normal rank | |||
Latest revision as of 18:54, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs |
scientific article |
Statements
An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs (English)
0 references
15 March 1999
0 references
generalized traveling salesman
0 references
heuristics
0 references
0 references
0 references
