Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510)
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: Efficient frameworks for greedy split and new depth first search split procedures for routing problems |
scientific article; zbMATH DE number 5828289
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient frameworks for greedy split and new depth first search split procedures for routing problems |
scientific article; zbMATH DE number 5828289 |
Statements
Efficient frameworks for greedy split and new depth first search split procedures for routing problems (English)
0 references
20 December 2010
0 references
routing problem
0 references
location routing problem
0 references
split
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
