The Covering Salesman Problem
From MaRDI portal
Recommendations
Cited in
(73)- On symmetric subtour problems
- A review of extensive facility location in networks
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- The median tour and maximal covering tour problems: Formulations and heuristics
- Approximation algorithms for the Geometric Covering Salesman Problem
- The time constrained maximal covering salesman problem
- Scheduling last-mile deliveries with truck-based autonomous robots
- Modelling beneficiaries' choice in disaster relief logistics
- Online covering salesman problem
- An integer programming-based local search for the covering salesman problem
- Mind the gap: a study of tube tour
- The vehicle routing-allocation problem: A unifying framework
- Multiobjective routing problems
- Variable neighbourhood structures for cycle location problems
- A branch-and-price algorithm for a vehicle routing with demand allocation problem
- Drone-assisted deliveries: new formulations for the flying sidekick traveling 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
- Spatial coverage in routing and path planning problems
- A location-or-routing problem with partial and decaying coverage
- 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 data-driven optimization framework for routing mobile medical facilities
- Maximal covering salesman problems with average travelling cost constraints
- A location-routing problem in glass recycling
- A branch-and-cut algorithm for the maximum covering cycle problem
- Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
- Topological design of a two-level network with ring-star configuration
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- A variable neighborhood search for solving the multi-vehicle covering tour problem
- Reduction rules for the covering tour problem
- The generalized covering salesman problem
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
- Insertion heuristics for central cycle problems
- Searching for a cycle with maximum coverage in undirected graphs
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
- Time constrained maximal covering salesman problem with weighted demands and partial coverage
- WATER SALESMAN PROBLEM
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
- A generalized model and a heuristic algorithm for the large-scale covering tour problem
- Iterative column generation algorithm for generalized multi-vehicle covering tour problem
- Service-constrained network design problems
- Imprecise constrained covering solid travelling salesman problem with credibility
- An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem
- An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
- The Ferry Cover Problem
- The clever shopper problem
- Learn global and optimize local: a data-driven methodology for last-mile routing
- A multi‐vehicle covering tour problem with speed optimization
- The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements
- Multiple traveling salesperson problem with drones: general variable neighborhood search approach
- The two‐echelon routing problem with truck and drones
- The generalized close enough traveling salesman problem
- The transit route arc-node service maximization problem
- A flow-based model for the multivehicle covering tour problem with route balancing
- A robust optimization framework for two-echelon vehicle and UAV routing for post-disaster humanitarian logistics operations
- Modeling a humanitarian-aid covering tour problem with location selection and vehicle assignment decisions
- A synchronized vessel and autonomous vehicle model for environmental monitoring: mixed integer linear programming model and adaptive matheuristic
- Survivable two-fault-tolerant ring star problem
- Exact algorithms and heuristics for the capacitated covering salesman problem
- A deep reinforcement learning hyperheuristic for the covering tour problem with varying coverage
- A survey on the traveling salesman problem and its variants in a warehousing context
- A unifying framework for selective routing problems
- Covering tour problem with varying coverage: application to marine environmental monitoring
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Self-service and home delivery combined: coordinating the route of a mobile parcel locker with the delivery tasks of its human driver
- Strategic route extension in transit networks
- Metaheuristics for the distance constrained generalized covering traveling salesman problem
- The bi-objective covering tour problem
- Budget constrained minimum cost connected medians
This page was built for publication: The Covering Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4732319)
