The min-max close-enough arc routing problem

DOI10.1016/J.EJOR.2021.10.047zbMATH Open1506.90216OpenAlexW3211268009MaRDI QIDQ2116901FDOQ2116901

Ángel Corberán, Nicola Bianchessi, Miguel Reula, Isaac Plana, José M. 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-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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Benchmarking optimization software with performance profiles.
• Branch-and-price: Column generation for solving huge integer programs
• Column Generation
• Column generation based primal heuristics
• The stacker crane problem and the directed general routing problem
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
• The generalized arc routing problem
• Solving the close-enough arc routing problem
• Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
• Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman 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
• The profitable close-enough arc routing problem

Cited In (1)

• On the minimum dummy-arc problem

Recommendations

• Approximate solutions for the capacitated arc routing problem 👍 👎
• An Approximation Algorithm for the Capacitated Arc Routing Problem 👍 👎
• The generalized arc routing problem 👍 👎
• Solving the close-enough arc routing 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 👍 👎
• The profitable close-enough arc routing problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)