The following pages link to The Covering Salesman Problem (Q4732319):
Displaying 50 items.
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
- Searching for a cycle with maximum coverage in undirected graphs (Q331987) (← links)
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
- Time constrained maximal covering salesman problem with weighted demands and partial coverage (Q342578) (← links)
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
- The transit route arc-node service maximization problem (Q621660) (← links)
- Strategic route extension in transit networks (Q817558) (← links)
- Metaheuristics for the distance constrained generalized covering traveling salesman problem (Q832809) (← links)
- The bi-objective covering tour problem (Q868132) (← links)
- Budget constrained minimum cost connected medians (Q876728) (← links)
- On symmetric subtour problems (Q1202764) (← links)
- A review of extensive facility location in networks (Q1278421) (← links)
- An efficient composite heuristic for the symmetric generalized traveling salesman problem (Q1296792) (← links)
- The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602) (← links)
- Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140) (← links)
- The time constrained maximal covering salesman problem (Q1631991) (← links)
- Scheduling last-mile deliveries with truck-based autonomous robots (Q1653394) (← links)
- Modelling beneficiaries' choice in disaster relief logistics (Q1699124) (← links)
- Online covering salesman problem (Q1743496) (← links)
- An integer programming-based local search for the covering salesman problem (Q1761202) (← links)
- Mind the gap: a study of tube tour (Q1761218) (← links)
- The vehicle routing-allocation problem: A unifying framework (Q1814811) (← links)
- Multiobjective routing problems (Q1919112) (← links)
- Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
- A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
- Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem (Q2037887) (← links)
- A parallel variable neighborhood search for solving covering salesman problem (Q2070124) (← links)
- A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak (Q2070131) (← links)
- A covering traveling salesman problem with profit in the last mile delivery (Q2070135) (← links)
- Spatial coverage in routing and path planning problems (Q2083923) (← links)
- A location-or-routing problem with partial and decaying coverage (Q2108134) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance (Q2147130) (← links)
- A data-driven optimization framework for routing mobile medical facilities (Q2196113) (← links)
- A location-routing problem in glass recycling (Q2259043) (← links)
- A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
- Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems (Q2294623) (← links)
- Topological design of a two-level network with ring-star configuration (Q2367422) (← links)
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem (Q2630221) (← links)
- A variable neighborhood search for solving the multi-vehicle covering tour problem (Q2631288) (← links)
- (Q2741492) (← links)
- The Generalized Covering Salesman Problem (Q2815466) (← links)
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530) (← links)
- Insertion heuristics for central cycle problems (Q3057168) (← links)
- A generalized model and a heuristic algorithm for the large-scale covering tour problem (Q4553890) (← links)
- Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem (Q4689379) (← links)
- Service-constrained network design problems (Q5054805) (← links)
- Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility (Q5114999) (← links)
- An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem (Q5148188) (← links)
- An integration of mixed VND and VNS: the case of the multivehicle covering tour problem (Q5278232) (← links)
