scientific article; zbMATH DE number 2156293

MaRDI QIDQ4668751zbMATH OpenFDO

Authors Gianpaolo Ghiani, Alain Hertz, G. Laporte

Publication date 15 April 2005

zbMATH Keywords

Arc routingBranch-and-cutRural Postman ProblemTabu SearchVariable Neighbourhood Search

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Search theory (90B40) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Recent results on arc routing problems: an annotated bibliography
• Arc routing problems: A review of the past, present, and future
• scientific article; zbMATH DE number 1568938
• The complexity of arc routing problems
• An approximation algorithm for the capacitated arc routing problem
• The capacitated arc routing problem: exact algorithms
• Improving robustness of solutions to arc routing problems
• Arc Routing
• The generalized arc routing problem

Cited in

(9)

• Variable neighbourhood search: Methods and applications
• Augment-insert algorithms for the capacitated arc routing problem
• New heuristic algorithms for the windy rural postman problem
• scientific article; zbMATH DE number 2134188 (Why is no real title available?)
• scientific article; zbMATH DE number 1520350 (Why is no real title available?)
• scientific article; zbMATH DE number 1568938 (Why is no real title available?)
• scientific article; zbMATH DE number 1568940 (Why is no real title available?)
• scientific article; zbMATH DE number 1568941 (Why is no real title available?)
• scientific article; zbMATH DE number 6741962 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4668751)