Pyramidal tours for the traveling salesman (Q4764887): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02331939408843938 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044980763 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Special cases of travelling salesman problems and heuristics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Universal conditions for algebraic travelling salesman problems to be efficiently solvable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pyramidal tours and the traveling salesman problem / rank | |||
Normal rank | |||
Latest revision as of 13:10, 23 May 2024
scientific article; zbMATH DE number 746339
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Pyramidal tours for the traveling salesman |
scientific article; zbMATH DE number 746339 |
Statements
Pyramidal tours for the traveling salesman (English)
0 references
5 September 1995
0 references
polynomial time
0 references
tour improvement
0 references
traveling salesman problems
0 references
optimal pyramidal tour
0 references
0 references
0 references
