Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph (Q5380984): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 21:04, 5 March 2024
scientific article; zbMATH DE number 7063738
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
