An integer programming-based local search for the covering salesman problem
DOI10.1016/J.COR.2012.01.004zbMATH Open1251.90338OpenAlexW2030714952MaRDI QIDQ1761202FDOQ1761202
Authors: Majid Salari, Zahra Naji-Azimi 
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
Recommendations
Applications of graph theory (05C90) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Mixed integer programming (90C11) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- The traveling salesman problem and its variations
- A new ILP-based refinement heuristic for vehicle routing problems
- The vehicle routing problem
- The Capacitated m-Ring-Star Problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- A heuristic procedure for the capacitated \(m\)-ring-star problem
- The median tour and maximal covering tour problems: Formulations and heuristics
- Heuristics for the multi-vehicle covering tour problem
- The Covering Tour Problem
- The Covering Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- The selective travelling salesman problem
- An ILP improvement procedure for the open vehicle routing problem
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Locating median cycles in networks
- The generalized covering salesman problem
- An integer linear programming local search for capacitated vehicle routing problems
- Approximation algorithms for the Geometric Covering Salesman Problem
Cited In (16)
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands
- Reduction rules for the covering tour problem
- The generalized covering salesman problem
- The Covering Salesman Problem
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem
- Iterative column generation algorithm for generalized multi-vehicle covering tour problem
- Solving the multi-vehicle multi-covering tour problem
- Imprecise constrained covering solid travelling salesman problem with credibility
- Social structure optimization in team formation
- A generalized model and a heuristic algorithm for the large-scale covering tour problem
- A parallel variable neighborhood search for solving covering salesman problem
- A covering traveling salesman problem with profit in the last mile delivery
- A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak
- A mixed integer linear program and tabu search approach for the complementary edge covering problem
- The time constrained maximal covering salesman problem
Uses Software
This page was built for publication: An integer programming-based local search for the covering salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761202)
