On the distance-constrained close enough arc routing problem
type: Item
instance of: scholarly article
title: On the distance-constrained close enough arc routing problem
zbMATH Open document ID: 1487.90547
author: Isaac Plana
author: Miguel Reula
author: Ángel Corberán
author: José M. Sanchis
published in: European Journal of Operational Research
publication date: 2021-06-04T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7355327
zbMATH Keywords: routing
zbMATH Keywords: distance constraints
zbMATH Keywords: close-enough
zbMATH Keywords: rural postman
zbMATH Keywords: branch and cut
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.09.012
OpenAlex ID: W3087264509
cites work: The generalized arc routing problem
cites work: Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
cites work: An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
cites work: A novel discretization scheme for the close enough traveling salesman problem
cites work: Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
cites work: Arc Routing
cites work: A cutting plane algorithm for the general routing problem
cites work: A matheuristic for the distance-constrained close-enough arc routing problem
cites work: The mixed general routing polyhedron
cites work: A polyhedral approach to the rural postman problem
cites work: The traveling salesman problem on a graph and some related integer polyhedra
cites work: A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
cites work: Benchmarking optimization software with performance profiles.
cites work: Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
cites work: Q5271460
cites work: The Covering Tour Problem
cites work: Q3447238
cites work: Solving the close-enough arc routing problem
cites work: New inequalities for the general routing problem
cites work: The stochastic close-enough arc routing problem
cites work: Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
DOI: 10.1016/J.EJOR.2020.09.012
description: scientific article; zbMATH DE number 7355327