Efficient algorithms under dynamic graphs to solve the capacitated arc routing problem with feasible sparse graph (Q5380984)
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 algorithms under dynamic graphs to solve the capacitated arc routing problem with feasible sparse graph |
scientific article; zbMATH DE number 7063738
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms under dynamic graphs to solve the capacitated arc routing problem with feasible sparse graph |
scientific article; zbMATH DE number 7063738 |
Statements
Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph (English)
0 references
7 June 2019
0 references
routing problems
0 references
graph theory
0 references
sparsity
0 references
tabu search
0 references
0.8509859442710876
0 references
0.8414626121520996
0 references
0.8376791477203369
0 references
0.8233609795570374
0 references
0.8195929527282715
0 references
