Pages that link to "Item:Q1734334"
From MaRDI portal
The following pages link to Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants (Q1734334):
Displaying 12 items.
- The clustered orienteering problem (Q296772) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
- Hybrid heuristic for the clustered orienteering problem (Q1691649) (← links)
- A biased random-key genetic algorithm for the set orienteering problem (Q2030452) (← links)
- Spatial coverage in routing and path planning problems (Q2083923) (← links)
- Generalized orienteering problem with resource dependent rewards (Q4629173) (← links)
- Selective generalized travelling salesman problem (Q5069320) (← links)
- A general variable neighborhood search approach for the minimum load coloring problem (Q6063505) (← links)
- An adaptive memory matheuristic for the set orienteering problem (Q6112827) (← links)
- Physician scheduling problem in mobile cabin hospitals of China during Covid-19 outbreak (Q6168128) (← links)
- An effective hybrid evolutionary algorithm for the clustered orienteering problem (Q6555127) (← links)
