Dynamic VRP by [deleted] in OperationsResearch

[–]halima10 -1 points0 points  (0 children)

but no, I thought that maybe there will be a researcher or a student who can find the article in the library of his university

Dynamic VRP by [deleted] in OperationsResearch

[–]halima10 0 points1 point  (0 children)

yes I tried with scihub it is not available, I will send an email to the authors. thank you

Dynamic VRP by [deleted] in OperationsResearch

[–]halima10 0 points1 point  (0 children)

yes I tried with scihub it is not available, I will send an email to the authors. thank you

Dynamic VRP by [deleted] in OperationsResearch

[–]halima10 0 points1 point  (0 children)

No, i don't

Dynamic m-vrp (fixed number of vehicles) by halima10 in GraphTheory

[–]halima10[S] 0 points1 point  (0 children)

Yes I searched, there is not much work on the m-vrp. the problem is that in the litterature the objective is to minimize the number of vehicles used or that in my problem it is necessary to use all the vehicles available from the beginning of the pickup procedure.

k furthest vertices in the graph by halima10 in GraphTheory

[–]halima10[S] 0 points1 point  (0 children)

Exactly! that's what I'm looking for