Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph

DOI10.1051/ro/2018087zbMath1414.90062OpenAlexW2895639320WikidataQ129138056 ScholiaQ129138056MaRDI QIDQ5380984

Adnan Yassine, Hamdi Dkhil, Sara Tfaili, Abdelkader Sbihi

Publication date: 7 June 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2018087

zbMATH Keywords

tabu searchgraph theoryrouting problemssparsity

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• CPLEX

This page was built for publication: Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph