Pages that link to "Item:Q744213"
From MaRDI portal
The following pages link to A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213):
Displaying 17 items.
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions (Q1748494) (← links)
- The covering radius and a discrete surface area for non-hollow simplices (Q2066303) (← links)
- New complexity results for Łukasiewicz logic (Q2317509) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- A review of computation of mathematically rigorous bounds on optima of linear programs (Q2399497) (← links)
- QMaxSATpb: a certified MaxSAT solver (Q2694600) (← links)
- Towards an Accurate Solution of Wireless Network Design Problems (Q2835670) (← links)
- Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem (Q4599322) (← links)
- Cutting planes for families implying Frankl’s conjecture (Q5207443) (← links)
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates (Q5358295) (← 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)
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework (Q6202766) (← links)
- Automating weight function generation in graph pebbling (Q6202944) (← links)
- Certified dominance and symmetry breaking for combinatorial optimisation (Q6488808) (← links)