Pages that link to "Item:Q4702310"
From MaRDI portal
The following pages link to Linear Programming in O([n3/ln n]L) Operations (Q4702310):
Displaying 17 items.
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- On incremental approximate saddle-point computation in zero-sum matrix games (Q286267) (← links)
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations (Q920841) (← links)
- Haifa 1985 conference on matrix theory (Q1085237) (← links)
- Solving related two- and three-dimensional linear programming problems in logarithmic time (Q1091934) (← links)
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
- Context-based unsupervised ensemble learning and feature ranking (Q1689607) (← links)
- Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352) (← links)
- Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse (Q1819538) (← links)
- A canonical form for pencils of matrices with applications to asymptotic linear programs (Q1908190) (← links)
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735) (← links)
- \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization (Q2349520) (← links)
- An efficient basis update for asymptotic linear programming (Q2365695) (← links)
- Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329) (← links)
- Bounds and approximations for multistage stochastic programs (Q2796801) (← links)
- Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained <i>ℓ</i><sub>1</sub> minimization (Q5107961) (← links)
- On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
