A LP-based heuristic for a time-constrained routing problem (Q2491773)
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: A LP-based heuristic for a time-constrained routing problem |
scientific article; zbMATH DE number 5028819
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A LP-based heuristic for a time-constrained routing problem |
scientific article; zbMATH DE number 5028819 |
Statements
A LP-based heuristic for a time-constrained routing problem (English)
0 references
29 May 2006
0 references
time constrained routing
0 references
set packing
0 references
column-and-row generation
0 references
Intelligent Tourist Problem
0 references
0 references
0.7870362401008606
0 references
0.7778403162956238
0 references
0.7507627010345459
0 references
0.748440682888031
0 references
0.7456594705581665
0 references
