Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph (Q5380984): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q129138056, #quickstatements; #temporary_batch_1728349196749 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1051/ro/2018087 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2895639320 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129138056 / rank | |||
Normal rank | |||
Latest revision as of 03:20, 8 October 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
