search

rte-france / challenge-roadef-2020

Apache License 2.0
20 stars 7 forks source link

Lower bounds for resources consumption #33

Open mfacc opened 3 years ago

mfacc commented 3 years ago

None of the instances in the sets A, B, C have non-trivial lower bounds for the resources. Can we assume that for the X set of hidden instances? Or we should provide a solver capable of dealing with nontrivial lower bounds for the resources?