On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem (Q1847167)
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: On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem |
scientific article; zbMATH DE number 1829878
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem |
scientific article; zbMATH DE number 1829878 |
Statements
On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem (English)
0 references
17 November 2002
0 references
traveling salesman
0 references
multiple time windows
0 references
constraint programming
0 references
branch andbound
0 references
iterative-cost-deepening
0 references
0 references
0 references
0 references
0 references
0 references
