Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph (Q5380984): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: CPLEX / rank | |||
Normal rank |
Revision as of 17:59, 29 February 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