Sequential and parallel local search for the time-constrained traveling salesman problem (Q1803676): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Binary Trees and Parallel Scheduling Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: How easy is local search? / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3033585 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5187226 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4003232 / rank | |||
Normal rank | |||
Latest revision as of 16:53, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sequential and parallel local search for the time-constrained traveling salesman problem |
scientific article |
Statements
Sequential and parallel local search for the time-constrained traveling salesman problem (English)
0 references
29 June 1993
0 references
local search
0 references
traveling salesman
0 references
time windows
0 references
sequential and parallel algorithms
0 references
local optimality
0 references
