[FEATURE] Resource constrained shortest-path

[andrea-cassioli-maersk]

I was wondering if there is any plan to provide an implementation for the resource constrained shortest path.

As inspiration, one might look at how boost graph is doing: https://www.boost.org/doc/libs/1_77_0/libs/graph/doc/r_c_shortest_paths.html

[KeRNeLith]

Hello @andrea-cassioli-maersk!

For now, unfortunately I think I will not have enough time on my spare time to do such implementation. The main plan I have is to make a release that will deprecate the binary serialization (using Binary Formatter) on old targets and think about replacing it by the usage of protobuf-net. But I'm not really advanced on it for now.

BTW if you have some already implemented stuff, or start of work on the subject, feel free to open a PR to have a look at it. :-)

[andrea-cassioli-maersk]

Thanks @KeRNeLith , we do have some in-house implementation and we are considering switch to Quik. So once we have finish our assessment, if we decide to use Quik we might be able to contribute. I'll keep you posted.