The following pages link to (Q4311911):
Displaying 11 items.
- A relaxation method for solving systems with infinitely many linear inequalities (Q691462) (← links)
- On compact formulations for integer programs solved by column generation (Q817199) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- Complexity of some cutting plane methods that use analytic centers (Q1352301) (← links)
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method (Q1361108) (← links)
- An analytic center cutting plane method for pseudomonotone variational inequalities (Q1374377) (← links)
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems (Q1815078) (← links)
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions (Q2010105) (← links)
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems (Q2129140) (← links)
- Algorithms for the quasiconvex feasibility problem (Q2570027) (← links)
- Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications (Q5861980) (← links)
