Privatized rural postman problems
From MaRDI portal
Publication:2496044
DOI10.1016/j.cor.2005.02.013zbMath1094.90034OpenAlexW2006790004MaRDI QIDQ2496044
Elena Fernández, Julián Aráoz, Cristina Zoltan
Publication date: 30 June 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.013
Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)
Related Items (22)
New results for the directed profitable rural postman problem ⋮ A branch-and-cut algorithm for the profitable windy rural postman problem ⋮ Multi-vehicle prize collecting arc routing for connectivity problem ⋮ On the collaboration uncapacitated arc routing problem ⋮ Multi-depot rural postman problems ⋮ A branch-and-cut algorithm for the maximum benefit Chinese postman problem ⋮ A scatter search algorithm for time-dependent prize-collecting arc routing problems ⋮ The profitable close-enough arc routing problem ⋮ The restricted Chinese postman problems with penalties ⋮ An ILP-refined tabu search for the directed profitable rural postman problem ⋮ The parking warden tour problem ⋮ Approximation algorithms for the restricted \(k\)-Chinese postman problems with penalties ⋮ Location routing problems on trees ⋮ A Decade of Capacitated Arc Routing ⋮ The undirected capacitated general routing problem with profits ⋮ The directed profitable rural postman problem with incompatibility constraints ⋮ Local search for the undirected capacitated arc routing problem with profits ⋮ The undirected capacitated arc routing problem with profits ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ Solving the prize-collecting rural postman problem ⋮ Solving the selective multi-category parallel-servicing problem ⋮ Profitable mixed capacitated arc routing and related problems
Cites Work
- On the cycle polytope of a binary matroid
- A branch-and-cut algorithm for the undirected rural postman problem
- Reductions to 1–matching polyhedra
- On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
- On general routing problems
- A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem
- Matching, Euler tours and the Chinese postman
- Combinatorial optimization. Theory and algorithms.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Privatized rural postman problems
