Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
An efficient algorithm for the minimum capacity cut problem
Mathematical Programming: Series A and B
Data structures for traveling salesmen
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Exact arithmetic at low cost—a case study in linear programming
Computational Geometry: Theory and Applications
Certifying and repairing solutions to large LPs how good are LP-solvers?
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Lifted Cover Inequalities for 0-1 Integer Programs: Computation
INFORMS Journal on Computing
A Computational Study of Search Strategies for Mixed Integer Programming
INFORMS Journal on Computing
K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
INFORMS Journal on Computing
Rigorous Lower and Upper Bounds in Linear Programming
SIAM Journal on Optimization
Safe bounds in linear and mixed-integer linear programming
Mathematical Programming: Series A and B
Operations Research Letters
On the Exact Separation of Mixed Integer Knapsack Cuts
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Improved Binary Space Partition merging
Computer-Aided Design
Fast and Accurate Bounds on Linear Programs
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Solving Very Sparse Rational Systems of Equations
ACM Transactions on Mathematical Software (TOMS)
An exact rational mixed-integer programming solver
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Safe lower bounds for graph coloring
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Automation and Remote Control
Computational experience with general cutting planes for the Set Covering problem
Operations Research Letters
Computing the Crosscap Number of a Knot Using Integer Programming and Normal Surfaces
ACM Transactions on Mathematical Software (TOMS)
Improving the accuracy of linear programming solvers with iterative refinement
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Valid Linear Programming Bounds for Exact Mixed-Integer Programming
INFORMS Journal on Computing
| Hi-index | 0.00 |
The use of floating-point calculations limits the accuracy of solutions obtained by standard LP software. We present a simplex-based algorithm that returns exact rational solutions, taking advantage of the speed of floating-point calculations and attempting to minimize the operations performed in rational arithmetic. Extensive computational results are presented.