Pages that link to "Item:Q1181915"
From MaRDI portal
The following pages link to Computational results of an interior point algorithm for large scale linear programming (Q1181915):
Displayed 12 items.
- A survey for the quadratic assignment problem (Q852928) (← links)
- Computational experience with a dual affine variant of Karmarkar's method for linear programming (Q1092808) (← links)
- A weighted least squares study of robustness in interior point linear programming (Q1260620) (← links)
- Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques (Q1283915) (← links)
- On the expected optimal value of random assignment problems: Experimental results and open questions (Q1315447) (← links)
- A QMR-based interior-point algorithm for solving linear programs (Q1361110) (← links)
- Symbiosis between linear algebra and optimization (Q1591197) (← links)
- Greedy randomized adaptive search procedures (Q1804580) (← links)
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (Q2457946) (← links)
- Implementing cholesky factorization for interior point methods of linear programming (Q3835659) (← links)
- Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs (Q4450560) (← links)
- (Q4953319) (← links)