Traveling salesman problem and local search (Q1195657): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Local search and the local structure of NP-complete problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Traveling salesman problem and local search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: How easy is local search? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of optimization problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Examples of Difficult Traveling Salesman Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4739657 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Complexity of Local Search for the Traveling Salesman Problem / rank | |||
Normal rank |
Latest revision as of 13:54, 16 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Traveling salesman problem and local search |
scientific article |
Statements
Traveling salesman problem and local search (English)
0 references
6 January 1993
0 references
traveling salesman
0 references
local search heuristics
0 references
NP-complete
0 references
difference equation
0 references