On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem (Q1847167): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: ILOG SCHEDULE / rank | |||
Normal rank | |||
Revision as of 10:44, 28 February 2024
scientific article
| 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 |
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
