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
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(98)00248-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037615545 / rank | |||
Normal rank | |||
Latest revision as of 10:29, 30 July 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
0 references
0 references
0 references
0 references
0 references
