The min-max close-enough arc routing problem

DOI10.1016/J.EJOR.2021.10.047MaRDI QIDQ2116901zbMATH OpenOpenAlexFDO

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

Publication date 18 March 2022

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

branch-and-cutroutingbranch-and-pricemin-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)

Recommendations

• Arc routing problems with min-max objectives
• Solving the close-enough arc routing problem
• On the distance-constrained close enough arc routing problem
• The profitable close-enough arc routing problem
• A matheuristic for the distance-constrained close-enough arc routing problem
• The Stochastic Close-Enough Arc Routing Problem
• An approximation algorithm for the capacitated arc routing problem
• Approximate solutions for the capacitated arc routing problem
• The capacitated arc routing problem: exact algorithms
• The generalized arc routing problem

Cites work

• scientific article; zbMATH DE number 2134188 (Why is no real title available?)
• scientific article; zbMATH DE number 1947382 (Why is no real title available?)
• scientific article; zbMATH DE number 6741970 (Why is no real title available?)
• A matheuristic for the distance-constrained close-enough arc routing problem
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
• Advances in meter Reading: heuristic solution of the close enough traveling salesman problem over a street network
• Arc routing problems with min-max objectives
• Benchmarking optimization software with performance profiles.
• Branch-and-price: Column generation for solving huge integer programs
• Column Generation
• Column generation based primal heuristics
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• On the distance-constrained close enough arc routing problem
• Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
• Solving the close-enough arc routing problem
• The Stochastic Close-Enough Arc Routing Problem
• The close enough traveling salesman problem: a discussion of several heuristics
• The generalized arc routing problem
• The profitable close-enough arc routing problem
• The stacker crane problem and the directed general routing problem

Cited in

(7)

• A branch-and-bound algorithm for the close-enough traveling salesman problem
• A matheuristic for the distance-constrained close-enough arc routing problem
• The Stochastic Close-Enough Arc Routing Problem
• On the distance-constrained close enough arc routing problem
• On the minimum dummy-arc problem
• Solving the close-enough arc routing problem
• The profitable close-enough arc routing problem

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

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