Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Lower bounds for resources consumption #33

Open
mfacc opened this issue Apr 9, 2021 · 0 comments
Open

Lower bounds for resources consumption #33

mfacc opened this issue Apr 9, 2021 · 0 comments

Comments

@mfacc
Copy link

mfacc commented Apr 9, 2021

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?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant