The following pages link to The set orienteering problem (Q1754239):
Displaying 18 items.
- The clustered orienteering problem (Q296772) (← links)
- The team orienteering problem (Q1266617) (← links)
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
- Hybrid heuristic for the clustered orienteering problem (Q1691649) (← links)
- Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants (Q1734334) (← links)
- A biased random-key genetic algorithm for the set orienteering problem (Q2030452) (← links)
- Spatial coverage in routing and path planning problems (Q2083923) (← links)
- The clustered team orienteering problem (Q2273693) (← links)
- Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics (Q2273922) (← links)
- Selective generalized travelling salesman problem (Q5069320) (← links)
- Making opportunity sales in attended home delivery (Q6068689) (← links)
- Orienteering with one endomorphism (Q6093270) (← links)
- An adaptive memory matheuristic for the set orienteering problem (Q6112827) (← links)
- Planning robust drone-truck delivery routes under road traffic uncertainty (Q6112843) (← links)
- The hazardous orienteering problem (Q6179713) (← links)
- An iterated local search for a multi‐period orienteering problem arising in a car patrolling application (Q6180047) (← links)
- Modeling and solving the two-level generalized median tour problem (Q6551171) (← links)
- An effective hybrid evolutionary algorithm for the clustered orienteering problem (Q6555127) (← links)
