Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search (Q4836838): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: John N. Hooker / rank | |||
| Property / author | |||
| Property / author: John N. Hooker / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/trsc.29.1.30 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2001062219 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:09, 19 March 2024
scientific article; zbMATH DE number 766527
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search |
scientific article; zbMATH DE number 766527 |
Statements
Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search (English)
0 references
23 November 1995
0 references
classical chain decomposition model
0 references
vehicle routing
0 references
time windows
0 references
