Heuristic algorithms for visiting the customers in a rolling schedule environment (Q850656)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5070837
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic algorithms for visiting the customers in a rolling schedule environment |
scientific article; zbMATH DE number 5070837 |
Statements
Heuristic algorithms for visiting the customers in a rolling schedule environment (English)
0 references
3 November 2006
0 references
Heuristic
0 references
Set packing
0 references
Column generation
0 references
Rolling schedule
0 references
Orienteering problem
0 references
0 references
0 references
0.7432985901832581
0 references
0.7400010824203491
0 references
0.7289131283760071
0 references
0.7130240797996521
0 references
0.6974404454231262
0 references
