A generalized model and a heuristic algorithm for the large-scale covering tour problem
From MaRDI portal
Publication:4553890
DOI10.1051/ro/2017090zbMath1401.90122OpenAlexW2780586658MaRDI QIDQ4553890
Publication date: 1 November 2018
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2017090
traveling salesman problemlocal search techniqueslarge-scale problemset-covering problemcovering tour problem
Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- A survey of recent research on location-routing problems
- A math-heuristic for the warehouse location-routing problem in disaster relief
- A branch-and-cut algorithm for the hub location and routing problem
- Location-routing: issues, models and methods
- The bi-objective covering tour problem
- An integer programming-based local search for the covering salesman problem
- Heuristics for the multi-vehicle covering tour problem
- Record breaking optimization results using the ruin and recreate principle
- An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
- The Generalized Covering Salesman Problem
- Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- A Greedy Heuristic for the Set-Covering Problem
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Mersenne twister
- The Covering Tour Problem
- The Covering Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: A generalized model and a heuristic algorithm for the large-scale covering tour problem
