The following pages link to (Q4471306):
Displaying 16 items.
- Computer-assisted proof of performance ratios for the differencing method (Q435724) (← links)
- Certifying feasibility and objective value of linear programs (Q453056) (← links)
- Certifying algorithms (Q465678) (← links)
- Testing cut generators for mixed-integer linear programming (Q734353) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- The final NETLIB-LP results (Q1417592) (← links)
- Exact solutions to linear programming problems (Q2467437) (← links)
- Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations (Q2802247) (← links)
- Iterative refinement for linear programming (Q2830949) (← links)
- Towards an Accurate Solution of Wireless Network Design Problems (Q2835670) (← links)
- An Exact Rational Mixed-Integer Programming Solver (Q3009754) (← links)
- Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work (Q5232110) (← links)
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates (Q5358295) (← links)
- Linear programming using limited-precision oracles (Q5918922) (← links)
- Extending the fundamental theorem of linear programming for strict inequalities (Q6666552) (← links)
