torressa / cspy

A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#
https://torressa.github.io/cspy/
MIT License
77 stars 24 forks source link

Adding modify accumulated cost in Callback #120

Open rezamirjalili1990 opened 3 months ago

rezamirjalili1990 commented 3 months ago

I would be grateful if the following features are added:

  1. For label extension, if the accumulated cost contains floor or ceil function, for example: when we add the edge (i,j) to label L:(c_L,R_L) where c_L is the accumulated cost of L and R_L is the accumulated resource consumption. c_L can be calculated as follows: c_L = floor(sum(c*R_L)), and c is the unit cost of consumption of resource

  2. Since, we have a floor function, it requires some modified label domination: if c_L1+eps<= c_L2 and R_L1<=R_L2, then label L_1 dominates L_2.

Thank you very much.