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

Update solval in src/mip/HighsCutGeneration.cpp #2085

Merged
merged 11 commits into from
Dec 16, 2024

Conversation

fwesselm
Copy link
Contributor

  • A variable may be complemented here, but its solution value is not updated accordingly.
  • Also, cut generation is currently implemented twice (additional copy for conflict generation). I added a single utility for this, which simplifies the code.
  • The effect on overall performance (in terms of geometric means) is small. However, a handful of long-running MIPs cannot be solved to optimality within 2 hours anymore (on Linux), because a different code path is taken.

@jajhall jajhall merged commit 93128a9 into ERGO-Code:latest Dec 16, 2024
101 of 102 checks passed
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

Successfully merging this pull request may close these issues.

2 participants