The following pages link to The museum visitor routing problem (Q969135):
Displaying 15 items.
- A simulated annealing heuristic for the team orienteering problem with time windows (Q439335) (← links)
- A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector (Q490386) (← links)
- Reducing network and computation complexities in neural based real-time scheduling scheme (Q632870) (← links)
- An efficient particle swarm optimizer with application to man-day project scheduling problems (Q1718586) (← links)
- Block layout for attraction-based enterprises (Q1754188) (← links)
- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090) (← links)
- New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
- Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (Q5085264) (← links)
- O(log m)-approximation for the routing open shop problem (Q5247701) (← links)
- A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem (Q5357744) (← links)
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (Q6048209) (← links)
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization (Q6068709) (← links)
