The Covering Tour Problem
From MaRDI portal
Publication:4363758
DOI10.1287/opre.45.4.568zbMath0887.90122OpenAlexW1966175066MaRDI QIDQ4363758
Michel Gendreau, Gilbert Laporte, Frédéric Semet
Publication date: 25 May 1998
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.45.4.568
Related Items
An integration of mixed VND and VNS: the case of the multivehicle covering tour problem, Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective, The static bicycle relocation problem with demand intervals, A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem, Locating median cycles in networks, The time constrained maximal covering salesman problem, A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem, Classification, models and exact algorithms for multi-compartment delivery problems, A variable neighborhood search for solving the multi-vehicle covering tour problem, An iterated local search algorithm for the team orienteering problem with variable profits, Exact algorithms for budgeted prize-collecting covering subgraph problems, A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance, A generalized model and a heuristic algorithm for the large-scale covering tour problem, Searching for a cycle with maximum coverage in undirected graphs, Optimal joint replenishment, delivery and inventory management policies for perishable products, Solving the multi-vehicle multi-covering tour problem, Time constrained maximal covering salesman problem with weighted demands and partial coverage, The bi-objective covering tour problem, Solving a generalized traveling salesperson problem with stochastic customers, Unnamed Item, The orienteering problem with variable profits, Multiobjective routing problems, An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem, A Markov decision process model on dynamic routing for target surveillance, The profitable close-enough arc routing problem, General network design: a unified view of combined location and network design problems, Multi-period location routing: an application to the planning of mobile clinic operations in Iraq, Exact and heuristic approaches for the cycle hub location problem, The multi-vehicle cumulative covering tour problem, A multi‐vehicle covering tour problem with speed optimization, The two‐echelon routing problem with truck and drones, Arc routing problems: A review of the past, present, and future, Heuristic and exact algorithms for a min-max selective vehicle routing problem, The generalized close enough traveling salesman problem, A data-driven optimization framework for routing mobile medical facilities, A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem, Modelling beneficiaries' choice in disaster relief logistics, Variable neighborhood tabu search and its application to the median cycle problem., Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem, Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem, Risk approaches for delivering disaster relief supplies, An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem, Online covering salesman problem, From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods, Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network, Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation, A branch-and-price algorithm for a vehicle routing with demand allocation problem, A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands, Multi-objective vehicle routing problems, A matheuristic for the distance-constrained close-enough arc routing problem, An integer programming-based local search for the covering salesman problem, The bi-objective stochastic covering tour problem, Models for a Steiner ring network design problem with revenues, Insertion heuristics for central cycle problems, Facility location with tree topology and radial distance constraints, The multi-vehicle probabilistic covering tour problem, On the distance-constrained close enough arc routing problem, Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem, Capacitated ring arborescence problems with profits, A branch-and-cut algorithm for the maximum covering cycle problem, Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems, Solving the close-enough arc routing problem, The Generalized Covering Salesman Problem, 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, The Ring Star Problem: Polyhedral analysis and exact algorithm, US coast guard air station location with respect to distress calls: a spatial statistics and optimization based methodology, The attractive traveling salesman problem, Spatial coverage in routing and path planning problems, Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems, A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem, A location-or-routing problem with partial and decaying coverage, A heuristic approach to the overnight security service problem
