Skip to content

Cap probing work and store reduced-cost bounds in a flat vector. - #3552

Closed
ludwikgorski-lab wants to merge 1 commit into
ERGO-Code:masterfrom
ludwikgorski-lab:cursor/probing-work-budget-0b12
Closed

ludwikgorski-lab wants to merge 1 commit into
ERGO-Code:masterfrom
ludwikgorski-lab:cursor/probing-work-budget-0b12

Conversation

@ludwikgorski-lab

Copy link
Copy Markdown

Draft. Not ready for review and not for merge yet.

Stop presolve probing once propagated bound changes exceed a work budget, and replace the per-column lurking-bound multimaps with a sorted vector.

Research notes attribute about 3× versus base on the plate-solver suite to the probing work cap plus flat reduced-cost. 10× is still open. This pull request is that pair, not the later path-preserving keepers.

Head: ludwikgorski-lab:cursor/probing-work-budget-0b12

Stop presolve probing once propagated bound changes exceed a
work budget, and replace the per-column lurking-bound multimaps
with a sorted vector.

Co-authored-by: ludwikgorski-lab <ludwikgorski-lab@users.noreply.github.com>
@jajhall

jajhall commented Nov 5, 2026

Copy link
Copy Markdown
Member

Thanks, I acknowledge that there are optimizations to do in this context, and this may provide pointers for how it can be achieved by our developers

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

5 participants