Pages that link to "Item:Q910347"

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

Displaying 50 items.

• The clustered orienteering problem (Q296772) (← links)
• A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
• Efficient meta-heuristics for the multi-objective time-dependent orienteering problem (Q323359) (← links)
• Single string planning problem arising in liner shipping industries: a heuristic approach (Q336521) (← links)
• The multi-district team orienteering problem (Q336760) (← links)
• A two-stage approach to the orienteering problem with stochastic weights (Q336923) (← links)
• Heuristics for the time dependent team orienteering problem: application to tourist route planning (Q337623) (← links)
• Solving the team orienteering problem with cutting planes (Q342446) (← links)
• Time constrained maximal covering salesman problem with weighted demands and partial coverage (Q342578) (← links)
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
• Robust UAV mission planning (Q490224) (← links)
• Local search for the undirected capacitated arc routing problem with profits (Q531469) (← links)
• Genetic algorithm for combinatorial path planning: the subtour problem (Q541476) (← links)
• The orienteering problem: a survey (Q617509) (← links)
• Selected combinatorial problems of computational biology (Q706944) (← links)
• Iterated local search for the team orienteering problem with time windows (Q833556) (← links)
• PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems (Q887207) (← links)
• Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691) (← links)
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
• A path relinking approach for the team orienteering problem (Q975993) (← links)
• The attractive traveling salesman problem (Q1043335) (← links)
• On symmetric subtour problems (Q1202764) (← links)
• A fast and effective heuristic for the orienteering problem (Q1266618) (← links)
• Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
• The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602) (← links)
• Strong linear programming relaxations for the orienteering problem (Q1328645) (← links)
• A TSSP+1 decomposition strategy for the vehicle routing problem (Q1342652) (← links)
• Tabu search for DNA sequencing with false negatives and false positives (Q1580973) (← links)
• A tabu search heuristic for the undirected selective travelling salesman problem (Q1609914) (← links)
• A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)
• Shared capacity routing problem -- an omni-channel retail study (Q1622824) (← links)
• Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
• A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
• The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
• Formulations for the orienteering problem with additional constraints (Q1686508) (← links)
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
• Online covering salesman problem (Q1743496) (← links)
• Solving the team orienteering arc routing problem with a column generation approach (Q1754007) (← links)
• Attractive orienteering problem with proximity and timing interactions (Q1754098) (← links)
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints (Q1754303) (← links)
• An integer programming-based local search for the covering salesman problem (Q1761202) (← links)
• Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans (Q1761229) (← links)
• A TABU search heuristic for the team orienteering problem (Q1764755) (← links)
• The vehicle routing-allocation problem: A unifying framework (Q1814811) (← links)
• Using artificial neural networks to solve the orienteering problem (Q1908298) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Multiobjective routing problems (Q1919112) (← links)
• On the nucleolus of the basic vehicle routing game (Q1919815) (← links)
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← links)