A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (Q1751254): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1504.02151 / rank | |||
Normal rank |
Revision as of 22:49, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions |
scientific article |
Statements
A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (English)
0 references
24 May 2018
0 references
quadratic travelling salesman problem
0 references
exact methods
0 references
combinatorial optimization
0 references
quadratic 0-1 programming
0 references
dynamic programming
0 references