The min-max close-enough arc routing problem

DOI10.1016/j.ejor.2021.10.047zbMath1506.90216OpenAlexW3211268009MaRDI QIDQ2116901

Miguel Reula, Isaac Plana, Angel Corberán, Nicola Bianchessi, José María Sanchis

Publication date: 18 March 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.10.047

zbMATH Keywords

branch-and-cutbranch-and-priceroutingmin-maxclose-enough arc routing problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The generalized arc routing problem
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• A matheuristic for the distance-constrained close-enough arc routing problem
• On the distance-constrained close enough arc routing problem
• Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
• The profitable close-enough arc routing problem
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Solving the close-enough arc routing problem
• Column Generation based Primal Heuristics
• Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
• The stochastic close-enough arc routing problem
• The stacker crane problem and the directed general routing problem
• Column Generation
• Benchmarking optimization software with performance profiles.

This page was built for publication: The min-max close-enough arc routing problem