The following pages link to Ilan Adler (Q344958):
Displayed 45 items.
- Some LCPs solvable in strongly polynomial time with Lemke's algorithm (Q344960) (← links)
- Monge and feasibility sequences in general flow problems (Q686244) (← links)
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (Q687079) (← links)
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (Q689144) (← links)
- Two-settlement electricity markets with price caps and Cournot generation firms (Q877614) (← links)
- New characterizations of row sufficient matrices (Q1020925) (← links)
- A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps (Q1100853) (← links)
- Interior path following primal-dual algorithms. I: Linear programming (Q1123121) (← links)
- Interior path following primal-dual algorithms. II: Convex quadratic programming (Q1123122) (← links)
- The max-flow problem with parametric capacities (Q1135779) (← links)
- A geometric view of parametric linear programming (Q1193520) (← links)
- Item:Q344958 (redirect page) (← links)
- Polynomial algorithms for linear programming over the algebraic numbers (Q1343466) (← links)
- An implementation of Karmarkar's algorithm for linear programming (Q1824551) (← links)
- The equivalence of linear programs and zero-sum games (Q1939509) (← links)
- Diameters of cocircuit graphs of oriented matroids: an update (Q2121728) (← links)
- Sufficient matrices belong to \(L\). (Q2490342) (← links)
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems (Q2640436) (← links)
- On the maximum number of Hamiltonian paths in tournaments (Q2725034) (← links)
- The coupon subset collection problem (Q2774451) (← links)
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension (Q3200877) (← links)
- New results on the average behavior of simplex algorithms (Q3337215) (← links)
- Modeling and Computing Two-Settlement Oligopolistic Equilibrium in a Congested Electricity Network (Q3392152) (← links)
- Advantageous Properties of Dual Transhipment Polyhedra (Q3491311) (← links)
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence (Q3491323) (← links)
- A Note on Strictly Competitive Games (Q3651214) (← links)
- A Family of Simplex Variants Solving an <i>m</i> × <i>d</i> Linear Program in Expected Number of Pivot Steps Depending on <i>d</i> Only (Q3755232) (← links)
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension (Q3773194) (← links)
- Long Monotone Paths in Abstract Polytopes (Q3907403) (← links)
- A Strongly Polynomial Algorithm for a Special Class of Linear Programs (Q4006338) (← links)
- Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm (Q4019975) (← links)
- (Q4123077) (← links)
- (Q4178777) (← links)
- (Q4178778) (← links)
- (Q4330131) (← links)
- Arbitrage and Growth Rate for Riskless Investments in a Stationary Economy (Q4372052) (← links)
- Coalescing times for IID random variables with applications to population biology (Q4434469) (← links)
- The coupon-collector's problem revisited (Q4435691) (← links)
- (Q4527208) (← links)
- (Q5202841) (← links)
- On Simplex Pivoting Rules and Complexity Theory (Q5418981) (← links)
- (Q5420345) (← links)
- A probabilistic model for the survivability of cells (Q5476138) (← links)
- Distribution of the Time of the First <i>k</i>-Record (Q5488540) (← links)
- New Proximal Newton-Type Methods for Convex Optimization (Q6345373) (← links)