The following pages link to Daniel E. Steffy (Q312705):
Displaying 20 items.
- On sublinear inequalities for mixed integer conic programs (Q312706) (← links)
- Strong matching preclusion for augmented cubes (Q387805) (← links)
- Strong local diagnosability of \((n,k)\)-star graphs and Cayley graphs generated by 2-trees with missing edges (Q396630) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- A concise characterization of strong knapsack facets (Q1634771) (← links)
- A complete classification of which \((n,k)\)-star graphs are Cayley graphs (Q1706438) (← links)
- On the problem of determining which \((n, k)\)-star graphs are Cayley graphs (Q2361079) (← links)
- Verifying integer programming results (Q2401153) (← links)
- Iterative Refinement for Linear Programming (Q2830949) (← links)
- Solving Very Sparse Rational Systems of Equations (Q2989125) (← links)
- An Exact Rational Mixed-Integer Programming Solver (Q3009754) (← links)
- Maximal vertex-connectivity of (Q3367056) (← links)
- (Q4677918) (← links)
- (Q4677979) (← links)
- Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization (Q4685751) (← links)
- Exact solutions to linear systems of equations using output sensitive lifting (Q5175270) (← links)
- Improving the accuracy of linear programming solvers with iterative refinement (Q5244534) (← links)
- (Q5251972) (← links)
- A few strong knapsack facets (Q5351614) (← links)
- Linear programming using limited-precision oracles (Q5918922) (← links)
