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

One algorithm for each cut callback #454

Open
guimarqu opened this issue Feb 26, 2021 · 1 comment
Open

One algorithm for each cut callback #454

guimarqu opened this issue Feb 26, 2021 · 1 comment
Labels
design enhancement New feature or request

Comments

@guimarqu
Copy link
Contributor

It would be nice if we indicate this only if at least one lazy cut callback is defined.
For this, I suggest to transform CutCallbacks to CutCallback which separates only one family of cuts. CutCallback would now whether it is lazy or facultative and its priority. Then every algorithm which uses cut separation (ColCutGenConquer and ColumnGeneration) should have a vector of CutCallback as a parameter. Then, there will be no overhead if no cut callbacks are defined. And it would be more flexible as priorities would allow us to separate "light" cut before "heavy" ones using priorities

Originally posted by @rrsadykov in #452 (comment)

@guimarqu guimarqu added this to the 0.5 milestone Feb 26, 2021
@guimarqu guimarqu added the enhancement New feature or request label Feb 26, 2021
@rrsadykov
Copy link
Collaborator

Ok, thanks Guillaume for posting this issue.

@guimarqu guimarqu removed this from the v0.5 milestone Dec 16, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
design enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

2 participants