Pages that link to "Item:Q910347"

The following pages link to The selective travelling salesman problem (Q910347):

Displaying 44 items.

• Column generation based heuristics for a generalized location routing problem with profits arising in space exploration (Q1926985) (← links)
• Finding the nucleolus of the vehicle routing game with time windows (Q1988954) (← links)
• A Tabu search algorithm for the probabilistic orienteering problem (Q2026967) (← links)
• A multi-period analysis of the integrated item-sharing and crowdshipping problem (Q2030599) (← links)
• Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
• UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections (Q2147172) (← links)
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007) (← links)
• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
• An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem (Q2233517) (← links)
• Mixed-integer programming approaches for the time-constrained maximal covering routing problem (Q2241905) (← links)
• A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
• Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics (Q2273922) (← links)
• A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
• A fast solution method for the time-dependent orienteering problem (Q2356249) (← links)
• The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
• A guided local search metaheuristic for the team orienteering problem (Q2378455) (← links)
• Evolution-inspired local improvement algorithm solving orienteering problem (Q2399337) (← links)
• A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
• An exact algorithm for team orienteering problems (Q2477614) (← links)
• Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem (Q2479572) (← links)
• Multi-objective vehicle routing problems (Q2480968) (← links)
• Orienteering problem with time-windows and updating delay (Q2658039) (← links)
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
• Multiperiod integrated spare parts and tour planning for on-site maintenance activities with stochastic repair requests (Q2676368) (← links)
• Trip planning for visitors in a service system with capacity constraints (Q2676374) (← links)
• Analysis of the selective traveling salesman problem with time-dependent profits (Q2701177) (← links)
• Pre-selection Strategies for Dynamic Collaborative Transportation Planning Problems (Q2806998) (← links)
• The Generalized Covering Salesman Problem (Q2815466) (← links)
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103) (← links)
• A two-stage vehicle routing model for large-scale bioterrorism emergencies (Q3057125) (← links)
• Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem (Q3627705) (← links)
• Shuffling heuristics for the storage location assignment in an AS/RS (Q4399000) (← links)
• A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem (Q5011677) (← links)
• An iterated local search algorithm for the team orienteering problem with variable profits (Q5058860) (← links)
• AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES (Q5315817) (← links)
• The orienteering problem with variable profits (Q5326782) (← links)
• Solving Relaxation Orienteering Problem Using DCA-CUT (Q5356984) (← links)
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem (Q5688010) (← links)
• Models for a Steiner ring network design problem with revenues (Q5943555) (← links)
• Clustered coverage orienteering problem of unmanned surface vehicles for water sampling (Q6072147) (← links)
• A revisited branch-and-cut algorithm for large-scale orienteering problems (Q6087525) (← links)
• Hybrid genetic algorithm for undirected traveling salesman problems with profits (Q6139377) (← links)
• The hazardous orienteering problem (Q6179713) (← links)
• A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application (Q6191670) (← links)