The following pages link to The Covering Tour Problem (Q4363758):
Displaying 50 items.
- The static bicycle relocation problem with demand intervals (Q296779) (← links)
- 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)
- Optimal joint replenishment, delivery and inventory management policies for perishable products (Q337009) (← links)
- Time constrained maximal covering salesman problem with weighted demands and partial coverage (Q342578) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- Risk approaches for delivering disaster relief supplies (Q647529) (← links)
- The multi-vehicle probabilistic covering tour problem (Q724092) (← links)
- The bi-objective covering tour problem (Q868132) (← links)
- Solving a generalized traveling salesperson problem with stochastic customers (Q868135) (← links)
- A mixed integer linear program and tabu search approach for the complementary edge covering problem (Q964367) (← links)
- US coast guard air station location with respect to distress calls: a spatial statistics and optimization based methodology (Q1041963) (← links)
- The attractive traveling salesman problem (Q1043335) (← links)
- The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602) (← links)
- Variable neighborhood tabu search and its application to the median cycle problem. (Q1410620) (← links)
- Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective (Q1616824) (← links)
- The time constrained maximal covering salesman problem (Q1631991) (← links)
- Solving the multi-vehicle multi-covering tour problem (Q1651551) (← links)
- Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
- The multi-vehicle cumulative covering tour problem (Q1686527) (← links)
- Modelling beneficiaries' choice in disaster relief logistics (Q1699124) (← links)
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
- Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem (Q1707079) (← links)
- Online covering salesman problem (Q1743496) (← links)
- A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands (Q1754370) (← 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 bi-objective stochastic covering tour problem (Q1762147) (← links)
- Heuristics for the multi-vehicle covering tour problem (Q1818567) (← links)
- A heuristic approach to the overnight security service problem (Q1868811) (← links)
- The cardinality constrained covering traveling salesman problem (Q1869889) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- Multiobjective routing problems (Q1919112) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- The closed knight tour problem in higher dimensions (Q1953312) (← links)
- A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
- A matheuristic for the distance-constrained close-enough arc routing problem (Q2001874) (← links)
- On the distance-constrained close enough arc routing problem (Q2029943) (← 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)
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem (Q2241905) (← links)
- An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices (Q2253558) (← links)
- Facility location with tree topology and radial distance constraints (Q2280295) (← links)
- Capacitated ring arborescence problems with profits (Q2284638) (← links)
