Pages that link to "Item:Q1380938"
From MaRDI portal
The following pages link to On the complexity of linear programming under finite precision arithmetic (Q1380938):
Displaying 11 items.
- Round-off estimates for second-order conic feasibility problems (Q447897) (← links)
- Probabilistic analysis of condition numbers for linear programming (Q700762) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- A primal-dual symmetric relaxation for homogeneous conic systems (Q883335) (← links)
- On the efficient use of the architecture of a small computer for LP algorithms (Q1068718) (← links)
- Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
- Probabilistic analysis of the Grassmann condition number (Q2340501) (← links)
- Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
- Solving linear programs with finite precision. II: Algorithms (Q2496177) (← links)
- (Q4822033) (← links)
- Linear programming using limited-precision oracles (Q5918922) (← links)
