Ilan Adler

According to our database1, Ilan Adler authored at least 37 papers between 1979 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
New Proximal Newton-Type Methods for Convex Optimization.
Proceedings of the 59th IEEE Conference on Decision and Control, 2020

2017
Random Knockout Tournaments.
Oper. Res., 2017

2016
Some LCPs solvable in strongly polynomial time with Lemke's algorithm.
Math. Program., 2016

2014
On Simplex Pivoting Rules and Complexity Theory.
Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013
The equivalence of linear programs and zero-sum games.
Int. J. Game Theory, 2013

A direct reduction of PPAD Lemke-verified linear complementarity problems to bimatrix games
CoRR, 2013

2011
Benchmark Problems for Totally Unimodular Set System Auction
CoRR, 2011

2009
The Berkeley Memorial.
Games Econ. Behav., 2009

A Note on Strictly Competitive Games.
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
Cournot equilibria in two-settlement electricity markets with system contingencies.
Int. J. Crit. Infrastructures, 2007

Two-settlement electricity markets with price caps and Cournot generation firms.
Eur. J. Oper. Res., 2007

A further step in decision support models for energy markets.
Eur. J. Oper. Res., 2007

2006
Sufficient matrices belong to L.
Math. Program., 2006

2005
Cournot Equilibrium in Price-Capped Two-Settlement Electricity Markets.
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
Coalescing times for IID random variables with applications to population biology.
Random Struct. Algorithms, 2003

2002
Baseball, Optimization, and the World Wide Web.
Interfaces, 2002

2001
On the maximum number of Hamiltonian paths in tournaments.
Random Struct. Algorithms, 2001

1994
Polynomial Algorithms for Linear Programming over the Algebraic Numbers.
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

Monge and Feasibility Sequences in General Flow Problems.
Discret. Appl. Math., 1993

1992
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices.
Math. Program., 1992

A Geometric View of Parametric Linear Programming.
Algorithmica, 1992

1991
Limiting behavior of the affine scaling continuous trajectories for linear programming problems.
Math. Program., 1991

A Strongly Polynomial Algorithm for a Special Class of Linear Programs.
Oper. Res., 1991

1990
Advantageous Properties of Dual Transhipment Polyhedra.
SIAM J. Discret. Math., 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

Interior path following primal-dual algorithms. part I: Linear programming.
Math. Program., 1989

An implementation of Karmarkar's algorithm for linear programming.
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
The max-flow problem with parametric capacities.
Discret. Appl. Math., 1979


  Loading...