A GRASP heuristic for the mixed Chinese postman problem
From MaRDI portal
Publication:1847247
DOI10.1016/S0377-2217(01)00296-XzbMath1081.90604OpenAlexW2022037516MaRDI QIDQ1847247
Rafael Martí, Angel Corberán, José María Sanchis
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00296-x
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Approximation algorithms for solving the constrained arc routing problem in mixed graphs, New heuristic algorithms for the windy rural postman problem, Hierarchical Chinese postman problem with fuzzy travel times, Solution of real-world postman problems, Recent results on Arc Routing Problems: An annotated bibliography
Cites Work
- A probabilistic heuristic for a computationally difficult set covering problem
- A cutting plane algorithm for the windy postman problem
- Computing approximate solutions of the maximum covering problem with GRASP
- Greedy randomized adaptive search procedures
- Odd Minimum Cut-Sets and b-Matchings
- On the complexity of edge traversing
- Approximation Algorithms for Some Postman Problems
- A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
- Matching, Euler tours and the Chinese postman
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- An optimal algorithm for the mixed Chinese postman problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
