Privatized rural postman problems

DOI10.1016/J.COR.2005.02.013MaRDI QIDQ2496044zbMATH OpenOpenAlexFDO

Authors Julián Aráoz, Elena Fernández, 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

zbMATH Keywords

arc routingcombinatoral optimizationRural postman

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Recommendations

• Solving the prize-collecting rural postman problem
• The directed profitable location rural postman problem
• The directed profitable rural postman problem with incompatibility constraints
• New results for the directed profitable rural postman problem
• A branch-and-cut algorithm for the profitable windy rural postman problem

Cites work

• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• scientific article; zbMATH DE number 1520350 (Why is no real title available?)
• scientific article; zbMATH DE number 2086917 (Why is no real title available?)
• scientific article; zbMATH DE number 1568941 (Why is no real title available?)
• A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem
• A branch-and-cut algorithm for the undirected rural postman problem
• Combinatorial optimization. Theory and algorithms.
• Matching, Euler tours and the Chinese postman
• On general routing problems
• On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
• On the cycle polytope of a binary matroid
• Reductions to 1–matching polyhedra

Cited in

(22)

• Location routing problems on trees
• The parking warden tour problem
• Multi-depot rural postman problems
• The directed profitable rural postman problem with incompatibility constraints
• New results for the directed profitable rural postman problem
• The profitable close-enough arc routing problem
• An ILP-refined tabu search for the directed profitable rural postman problem
• A decade of capacitated arc routing
• Local search for the undirected capacitated arc routing problem with profits
• Solving the selective multi-category parallel-servicing problem
• Multi-vehicle prize collecting arc routing for connectivity problem
• Solving the prize-collecting rural postman problem
• Approximation algorithms for the restricted \(k\)-Chinese postman problems with penalties
• The undirected capacitated general routing problem with profits
• A branch-and-cut algorithm for the profitable windy rural postman problem
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem
• The undirected capacitated arc routing problem with profits
• A scatter search algorithm for time-dependent prize-collecting arc routing problems
• The restricted Chinese postman problems with penalties
• On the collaboration uncapacitated arc routing problem
• Recent results on arc routing problems: an annotated bibliography
• Profitable mixed capacitated arc routing and related problems

This page was built for publication: Privatized rural postman problems

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