The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The pickup and delivery traveling salesman problem with first-in-first-out loading |
scientific article; zbMATH DE number 5506609
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The pickup and delivery traveling salesman problem with first-in-first-out loading |
scientific article; zbMATH DE number 5506609 |
Statements
The pickup and delivery traveling salesman problem with first-in-first-out loading (English)
0 references
12 February 2009
0 references
traveling salesman problem
0 references
pickup and delivery
0 references
first-in-first-out
0 references
integer programming
0 references
tabu search
0 references
iterated local search
0 references
0 references
0 references
0 references
0 references
0.8629128932952881
0 references
0.8622955083847046
0 references
0.8312065005302429
0 references
0.8216234445571899
0 references
0.8214130401611328
0 references
