Enhancement to HPresolve::enumerateSolutions

[fwesselm]

• This PR adds an enhancement to HPresolve::enumerateSolutions suggested by @Opt-Mucca (thank you!)
• The code now checks if all binary variables (from a constraint) form a clique.
• The average solution times and numbers of branching nodes increase by around 1% with this code change. However, 7 additional problems can be solved to optimality within the time limit of 2 hours.

[codecov]

Codecov Report

✅ All modified and coverable lines are covered by tests.
✅ Project coverage is 80.31%. Comparing base (a058a69) to head (4e81c34).
⚠️ Report is 31 commits behind head on latest.

Additional details and impacted files

@@            Coverage Diff             @@
##           latest    #2761      +/-   ##
==========================================
- Coverage   80.32%   80.31%   -0.02%     
==========================================
  Files         348      348              
  Lines       86073    86092      +19     
==========================================
+ Hits        69141    69147       +6     
- Misses      16932    16945      +13     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.

[jajhall]

That's great, thanks, @fwesselm !

[Opt-Mucca]

Not clear to me why this change would result in a 1% increase in nodes, so pretty confident that's noise. Happy with the change, and the +7 instances being solved is great!