The following pages link to Daniele Ferone (Q342456):
Displaying 18 items.
- The constrained shortest path tour problem (Q342457) (← links)
- A dynamic programming algorithm for solving the \(k\)-color shortest path problem (Q2047192) (← links)
- A generalized shortest path tour problem with time windows (Q2082551) (← links)
- A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations (Q2147036) (← links)
- Shortest path tour problem with time windows (Q2282521) (← links)
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems (Q2668700) (← links)
- The rainbow Steiner tree problem (Q2669791) (← links)
- Hybridizations of GRASP with path relinking for the far from most string problem (Q2811940) (← links)
- An efficient exact approach for the constrained shortest path tour problem (Q4972542) (← links)
- Solution approaches for the vehicle routing problem with occasional drivers and time windows (Q5058379) (← links)
- A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times (Q5232502) (← links)
- On the Far from Most String Problem, One of the Hardest String Selection Problems (Q5253264) (← links)
- Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping (Q6063502) (← links)
- A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem (Q6069764) (← links)
- The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions (Q6087141) (← links)
- Efficient GRASP solution approach for the prisoner transportation problem (Q6164367) (← links)
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm (Q6179711) (← links)
- Hybridizing a matheuristic with ALNS for the optimal collection and delivery of medical specimens (Q6609700) (← links)
