Pages that link to "Item:Q4624885"
From MaRDI portal
The following pages link to Extending time‐to‐target plots to multiple instances (Q4624885):
Displaying 7 items.
- A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands (Q1654357) (← links)
- An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem (Q2242390) (← links)
- Solution approaches for the vehicle routing problem with occasional drivers and time windows (Q5058379) (← 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)
- Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic (Q6088236) (← links)
- Efficient GRASP solution approach for the prisoner transportation problem (Q6164367) (← links)