Pages that link to "Item:Q1328645"

The following pages link to Strong linear programming relaxations for the orienteering problem (Q1328645):

Displaying 18 items.

• Efficient meta-heuristics for the multi-objective time-dependent orienteering problem (Q323359) (← links)
• The orienteering problem: a survey (Q617509) (← links)
• A fast and effective heuristic for the orienteering problem (Q1266618) (← links)
• Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
• A TSSP+1 decomposition strategy for the vehicle routing problem (Q1342652) (← links)
• Using artificial neural networks to solve the orienteering problem (Q1908298) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Coupling ant colony systems with strong local searches (Q1926808) (← 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)
• Mixed-integer programming approaches for the time-constrained maximal covering routing problem (Q2241905) (← links)
• A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
• An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
• A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← 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)
• 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)