Pages that link to "Item:Q1926697"
From MaRDI portal
The following pages link to The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697):
Displayed 11 items.
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826) (← links)
- Efficient meta-heuristics for the multi-objective time-dependent orienteering problem (Q323359) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
- A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← 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)
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
- An iterative three-component heuristic for the team orienteering problem with time windows (Q2255940) (← links)
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems (Q2256206) (← links)