An integer programming-based local search for the covering salesman problem
From MaRDI portal
(Redirected from Publication:1761202)
Recommendations
Cites work
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A heuristic procedure for the capacitated \(m\)-ring-star problem
- A new ILP-based refinement heuristic for vehicle routing problems
- An Effective Heuristic Algorithm for the Traveling-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
- An integer linear programming local search for capacitated vehicle routing problems
- Approximation algorithms for the Geometric Covering Salesman Problem
- Heuristics for the multi-vehicle covering tour problem
- Locating median cycles in networks
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- TSPLIB—A Traveling Salesman Problem Library
- The Capacitated m-Ring-Star Problem
- The Covering Salesman Problem
- The Covering Tour Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- The generalized covering salesman problem
- The median tour and maximal covering tour problems: Formulations and heuristics
- The selective travelling salesman problem
- The traveling salesman problem and its variations
- The vehicle routing 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
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)