A parallel tabu search algorithm for large traveling salesman problems (Q1329785): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127908973, #quickstatements; #temporary_batch_1722635374576 |
||
| (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.1016/0166-218x(92)00033-i / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2095546721 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127908973 / rank | |||
Normal rank | |||
Latest revision as of 22:50, 2 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel tabu search algorithm for large traveling salesman problems |
scientific article |
Statements
A parallel tabu search algorithm for large traveling salesman problems (English)
0 references
21 June 2000
0 references
0 references
0 references
0 references
