An integer programming-based local search for the covering salesman problem
From MaRDI portal
Publication:1761202
DOI10.1016/j.cor.2012.01.004zbMath1251.90338MaRDI QIDQ1761202
Zahra Naji-Azimi, Majid Salari
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.01.004
05C90: Applications of graph theory
90C11: Mixed integer programming
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
05C85: Graph algorithms (graph-theoretic aspects)
05C45: Eulerian and Hamiltonian graphs
Related Items
A generalized model and a heuristic algorithm for the large-scale covering tour problem, Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem, Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility, Social structure optimization in team formation, The time constrained maximal covering salesman problem, Solving the multi-vehicle multi-covering tour problem, A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands, A parallel variable neighborhood search for solving covering salesman problem, A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak, A covering traveling salesman problem with profit in the last mile delivery, A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
Uses Software
Cites Work
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
- A heuristic procedure for the capacitated \(m\)-ring-star problem
- The selective travelling salesman problem
- An ILP improvement procedure for the open vehicle routing problem
- The median tour and maximal covering tour problems: Formulations and heuristics
- Approximation algorithms for the Geometric Covering Salesman Problem
- The traveling salesman problem and its variations
- Heuristics for the multi-vehicle covering tour problem
- Locating median cycles in networks
- A new ILP-based refinement heuristic for vehicle routing problems
- The Vehicle Routing Problem
- The Generalized Covering Salesman Problem
- The Capacitated m-Ring-Star Problem
- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- TSPLIB—A Traveling Salesman Problem Library
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- The Covering Tour Problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- The Covering Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
