The Covering Tour Problem

DOI10.1287/OPRE.45.4.568MaRDI QIDQ4363758zbMATH OpenOpenAlexFDO

Authors Michel Gendreau, G. Laporte, F. 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

zbMATH Keywords

heuristiccovering tour problemexact branch-and-cut algorithmminimum length Hamiltonian cycle

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• A GRAST/VNS metaheuristic for an approximate solution of the covering tour problem
• scientific article; zbMATH DE number 2209648
• Heuristics for the multi-vehicle covering tour problem
• A generalized model and a heuristic algorithm for the large-scale covering tour problem
• Reduction rules for the covering tour problem

Cited in

(91)

• A variable neighborhood search for solving the multi-vehicle covering tour problem
• Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems
• An iterated local search algorithm for the team orienteering problem with variable profits
• Facility location with tree topology and radial distance constraints
• An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem
• A comprehensive survey on the generalized traveling 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
• Risk approaches for delivering disaster relief supplies
• A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• Reduction rules for the covering tour problem
• The generalized covering salesman problem
• The cardinality constrained covering traveling salesman problem
• A matheuristic for the distance-constrained close-enough arc routing problem
• 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
• Online covering salesman problem
• The Covering Salesman Problem
• Solving the close-enough arc routing problem
• Mixed-integer programming approaches for the time-constrained maximal covering routing problem
• The multi-vehicle probabilistic covering tour problem
• Variable neighborhood tabu search and its application to the median cycle problem.
• A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
• The static bicycle relocation problem with demand intervals
• The profitable close-enough arc routing problem
• Capacitated ring arborescence problems with profits
• A branch-and-bound algorithm for the close-enough traveling salesman problem
• Iterative column generation algorithm for generalized multi-vehicle covering tour problem
• A robust optimization framework for two-echelon vehicle and UAV routing for post-disaster humanitarian logistics operations
• Mind the gap: a study of tube tour
• The two‐echelon routing problem with truck and drones
• The orienteering problem with variable profits
• On the distance-constrained close enough arc routing problem
• Arc routing problems: A review of the past, present, and future
• General network design: a unified view of combined location and network design problems
• The closed knight tour problem in higher dimensions
• A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance
• Exact algorithms for budgeted prize-collecting covering subgraph problems
• Solving the multi-vehicle multi-covering tour problem
• Advances in meter Reading: heuristic solution of the close enough traveling salesman problem over a street network
• The multi-vehicle cumulative covering tour problem
• Models for a Steiner ring network design problem with revenues
• The median tour and maximal covering tour problems: Formulations and heuristics
• Heuristic and exact algorithms for a min-max selective vehicle routing problem
• Searching for a cycle with maximum coverage in undirected graphs
• Optimal joint replenishment, delivery and inventory management policies for perishable products
• scientific article; zbMATH DE number 2209648 (Why is no real title available?)
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
• Multiobjective routing problems
• A branch-and-cut algorithm for the maximum covering cycle problem
• Solving a generalized traveling salesperson problem with stochastic customers
• A multi‐vehicle covering tour problem with speed optimization
• A Markov decision process model on dynamic routing for target surveillance
• The bi-objective stochastic covering tour problem
• Insertion heuristics for central cycle problems
• Time constrained maximal covering salesman problem with weighted demands and partial coverage
• Heuristics for the multi-vehicle covering tour problem
• Practical methods for computing large covering tours and cycle covers with turn cost
• An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
• Multi-period location routing: an application to the planning of mobile clinic operations in Iraq
• US coast guard air station location with respect to distress calls: a spatial statistics and optimization based methodology
• The attractive traveling salesman problem
• The bi-objective covering tour problem
• A generalized model and a heuristic algorithm for the large-scale covering tour problem
• A location-or-routing problem with partial and decaying coverage
• Exact and heuristic approaches for the cycle hub location 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
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• A heuristic approach to the overnight security service problem
• A flow-based model for the multivehicle covering tour problem with route balancing
• A mixed integer linear program and tabu search approach for the complementary edge covering problem
• Modelling beneficiaries' choice in disaster relief logistics
• The Ferry Cover Problem
• From single-objective to multi-objective vehicle routing problems: motivations, case studies, and methods
• Health care logistics, emergency preparedness, and disaster relief: new challenges for routing problems with a focus on the austrian situation
• Multi-objective vehicle routing problems
• A variable neighborhood search algorithm for cost-balanced travelling salesman problem
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
• A data-driven optimization framework for routing mobile medical facilities
• Locating median cycles in networks
• Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
• Spatial coverage in routing and path planning problems
• The time constrained maximal covering salesman problem
• A branch-and-price algorithm for a vehicle routing with demand allocation problem
• The covering Canadian traveller problem
• An integer programming-based local search for the covering salesman problem
• The generalized close enough traveling salesman problem
• A GRAST/VNS metaheuristic for an approximate solution of the covering tour problem

This page was built for publication: The Covering Tour Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4363758)