Eulerian location problems

DOI<291::AID-NET9>3.0.CO;2-4 10.1002/(SICI)1097-0037(199912)34:4<291::AID-NET9>3.0.CO;2-4zbMath0948.90085OpenAlexW2084678817MaRDI QIDQ4934874

Gianpaolo Ghiani, Gilbert Laporte

Publication date: 30 January 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199912)34:4<291::aid-net9>3.0.co;2-4

zbMATH Keywords

branch-and-cut algorithmrural postman problemarc routing

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items

Distribution network design on the battlefield, Location-routing: issues, models and methods, The capacitated arc routing problem with refill points, Location-arc routing problem: heuristic approaches and test instances, Location arc routing problem with inventory constraints, On approximate data reduction for the Rural Postman Problem: Theory and experiments, Location Science in Canada, The directed profitable location rural postman problem, A variable neighborhood descent algorithm for a real waste collection problem with mobile depots, A taxonomical analysis, current methods and objectives on location-routing problems, The aircraft maintenance base location problem

Uses Software

• CPLEX

Cites Work

• A polyhedral approach to the rural postman problem
• Approximating minimum-cost graph problems with spanning tree edges
• Approximation Algorithms for Some Postman Problems
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Improvement Procedures for the Undirected Rural Postman Problem
• Matching, Euler tours and the Chinese postman