Pages that link to "Item:Q1424293"
From MaRDI portal
The following pages link to Solving linear programs with finite precision. I: Condition numbers and random programs (Q1424293):
Displaying 16 items.
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← 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)
- Optimal routing in double loop networks (Q995561) (← links)
- Condition measures and properties of the central trajectory of a linear program (Q1290648) (← links)
- Investigation of solutions of randomly generated integer programming problems with 0-1 variables (Q1364109) (← links)
- On the complexity of linear programming under finite precision arithmetic (Q1380938) (← links)
- On the expected condition number of linear programming problems (Q1402168) (← links)
- Solving linear programs with finite precision. II: Algorithms (Q2496177) (← links)
- Intrinsic volumes of symmetric cones and applications in convex programming (Q2515035) (← links)
- Sign consistent linear programming problems (Q3648620) (← links)
- (Q4822033) (← links)
- Computation of condition numbers for linear programming problems using Peña’s method (Q5475283) (← links)
- Unifying Condition Numbers for Linear Programming (Q5704143) (← links)
- Probabilistic analyses of condition numbers (Q5740078) (← links)
- A new condition number for linear programming (Q5955567) (← links)
