maximum-closure

Here is 1 public repository matching this topic...

fabiofurini / macroitems

The LP relaxation of the precedence-constrained knapsack problem through parametric maximum closure: canonical macroitem sequences, dual certificates, reduced costs over the dual face

linear-programming operations-research combinatorial-optimization open-pit-mining precedence-constrained-knapsack maximum-closure parametric-minimum-cut

Updated Sep 5, 2026
Python

Add this topic to your repo

To associate your repository with the maximum-closure topic, visit your repo's landing page and select "manage topics."

Learn more