The min-max close-enough arc routing problem-Reference-Cited by-同舟云学术

The min-max close-enough arc routing problem

Published:2021-10 Issue: Volume: Page:
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Bianchessi Nicola,Corberán Ángel,Plana Isaac^ORCID,Reula Miguel,Sanchis José M.^ORCID

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference29 articles.

1. Contributions to multiple postmen problems;Ahr,2004

2. New heuristics and lower bounds for the min-max K-Chinese postman problem;Ahr,2002

3. A tabu search algorithm for the min-max K-Chinese postman problem;Ahr;Computers and Operations Research,2006

4. Solution of a min-max vehicle routing problem;Applegate;INFORMS Journal on Computing,2002

5. The generalized arc routing problem;Aráoz;TOP,2017

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. VNS with Path Relinking for the Profitable Close-Enough Arc Routing Problem;Lecture Notes in Computer Science;2024

2. New Models for Close Enough Facility Location Problems;2024

3. Heuristics for the Profitable Close-Enough Arc Routing Problem;Expert Systems with Applications;2023-11

4. Lagrangian relaxation-based decomposition approaches for the capacitated arc routing problem in the state-space-time network;Transportation Letters;2022-11-22

5. The Profitable Close-Enough Arc Routing Problem;Computers & Operations Research;2022-04