On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
From MaRDI portal
Publication:3635191
DOI10.1287/opre.51.2.281.12790zbMath1163.90709MaRDI QIDQ3635191
Elena Fernández, Robert Garfinkel, Oscar Meza, Maruja Ortega
Publication date: 5 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/288d6f93a552a90996f9d16cd35f40aeb3fd10cf
90C35: Programming involving graphs or networks
90C27: Combinatorial optimization
90B20: Traffic problems in operations research
Related Items
Solving the prize-collecting rural postman problem, A heuristic for the periodic rural postman problem, Privatized rural postman problems, A constructive heuristic for the undirected rural postman problem, Recent results on Arc Routing Problems: An annotated bibliography