Pages that link to "Item:Q2401153"
From MaRDI portal
The following pages link to Verifying integer programming results (Q2401153):
Displaying 9 items.
- Cutting planes for families implying Frankl’s conjecture (Q5207443) (← links)
- A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture (Q5883707) (← links)
- A computational status update for exact rational mixed integer programming (Q5918427) (← links)
- A computational status update for exact rational mixed integer programming (Q5925645) (← links)
- Branch-and-bound solves random binary IPs in poly\((n)\)-time (Q6041109) (← links)
- Compressing branch-and-bound trees (Q6086013) (← links)
- Characterizing 3-Sets in Union-Closed Families (Q6112173) (← links)
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework (Q6202766) (← links)
- Certified dominance and symmetry breaking for combinatorial optimisation (Q6488808) (← links)