Ilan Adler
According to our database1,
Ilan Adler
authored at least 40 papers
between 1976 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
A Generalization of von Neumann's Reduction from the Assignment Problem to Zero-Sum Games.
CoRR, 2024
2021
Electron. J. Comb., 2021
2020
Proceedings of the 59th IEEE Conference on Decision and Control, 2020
2017
2016
Math. Program., 2016
2014
Proceedings of the Integer Programming and Combinatorial Optimization, 2014
2013
A direct reduction of PPAD Lemke-verified linear complementarity problems to bimatrix games
CoRR, 2013
2011
2009
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009
2008
Modeling and Computing Two-Settlement Oligopolistic Equilibrium in a Congested Electricity Network.
Oper. Res., 2008
2007
Int. J. Crit. Infrastructures, 2007
Eur. J. Oper. Res., 2007
Eur. J. Oper. Res., 2007
2006
2005
Proceedings of the 38th Hawaii International Conference on System Sciences (HICSS-38 2005), 2005
2004
Computing Cournot Equilibria in Two Settlement Electricity Markets with Transmission Constraints.
Proceedings of the 37th Hawaii International Conference on System Sciences (HICSS-37 2004), 2004
2003
Random Struct. Algorithms, 2003
2002
2001
Random Struct. Algorithms, 2001
1994
Algorithmica, 1994
1993
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio.
Math. Program., 1993
1992
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices.
Math. Program., 1992
1991
Limiting behavior of the affine scaling continuous trajectories for linear programming problems.
Math. Program., 1991
Oper. Res., 1991
1990
A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension.
Math. Oper. Res., 1990
An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence.
Math. Oper. Res., 1990
1989
Interior path following primal-dual algorithms. part II: Convex quadratic programming.
Math. Program., 1989
Math. Program., 1989
Math. Program., 1989
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm.
INFORMS J. Comput., 1989
1987
A simplex variant solving an <i>m</i> times <i>d</i> linear program in <i>O(min(m<sup>2</sup>, d<sup>2</sup>)</i> expected number of pivot steps.
J. Complex., 1987
1986
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.
Math. Oper. Res., 1986
1985
A Simplex Algorithm Whose Average Number of Steps Is Bounded between Two Quadratic Functions of the Smaller Dimension
J. ACM, October, 1985
1979
1976