Pages that link to "Item:Q1818567"

The following pages link to Heuristics for the multi-vehicle covering tour problem (Q1818567):

Displaying 36 items.

• A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
• Time constrained maximal covering salesman problem with weighted demands and partial coverage (Q342578) (← links)
• The multi-vehicle probabilistic covering tour problem (Q724092) (← links)
• Metaheuristics for the distance constrained generalized covering traveling salesman problem (Q832809) (← links)
• Multicriteria tour planning for mobile healthcare facilities in a developing country (Q864026) (← links)
• Design of an IT-driven decision support system for vehicle routing and scheduling. (Q1412738) (← links)
• Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective (Q1616824) (← links)
• Solving the multi-vehicle multi-covering tour problem (Q1651551) (← links)
• The multi-vehicle cumulative covering tour problem (Q1686527) (← links)
• Modelling beneficiaries' choice in disaster relief logistics (Q1699124) (← 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)
• The bi-objective stochastic covering tour problem (Q1762147) (← links)
• A heuristic approach to the overnight security service problem (Q1868811) (← links)
• A parallel variable neighborhood search for solving covering salesman problem (Q2070124) (← 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 data-driven optimization framework for routing mobile medical facilities (Q2196113) (← links)
• Robust strategic planning for mobile medical units with steerable and unsteerable demands (Q2239842) (← links)
• Capacitated ring arborescence problems with profits (Q2284638) (← links)
• Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems (Q2294623) (← links)
• Multi-objective vehicle routing problems (Q2480968) (← 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)
• A Markov decision process model on dynamic routing for target surveillance (Q2669763) (← links)
• A Neural-Network-Based Approach to the Double Traveling Salesman Problem (Q2780866) (← links)
• Solving the close-enough arc routing problem (Q2811327) (← links)
• Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation (Q3564375) (← 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)
• Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility (Q5114999) (← links)
• An integration of mixed VND and VNS: the case of the multivehicle covering tour problem (Q5278232) (← links)
• Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems (Q5501871) (← links)
• A multi‐vehicle covering tour problem with speed optimization (Q6065856) (← links)
• A flow-based model for the multivehicle covering tour problem with route balancing (Q6495377) (← links)