 | 2008 |
| 21 |  | Jian Yao,
Ilan Adler,
Shmuel S. Oren:
Modeling and Computing Two-Settlement Oligopolistic Equilibrium in a Congested Electricity Network.
Operations Research 56(1): 34-47 (2008) |
| 2007 |
| 20 |  | Andrés Ramos,
Ilan Adler:
A further step in decision support models for energy markets.
European Journal of Operational Research 181(3): 1243-1244 (2007) |
| 19 |  | Jian Yao,
Shmuel S. Oren,
Ilan Adler:
Two-settlement electricity markets with price caps and Cournot generation firms.
European Journal of Operational Research 181(3): 1279-1296 (2007) |
| 2006 |
| 18 |  | Ilan Adler,
Richard W. Cottle,
Sushil Verma:
Sufficient matrices belong to L.
Math. Program. 106(2): 391-401 (2006) |
| 2005 |
| 17 |  | Jian Yao,
Bert Willems,
Shmuel Oren,
Ilan Adler:
Cournot Equilibrium in Price-Capped Two-Settlement Electricity Markets.
HICSS 2005 |
| 2004 |
| 16 |  | Jian Yao,
Shmuel Oren,
Ilan Adler:
Computing Cournot Equilibria in Two Settlement Electricity Markets with Transmission Constraints.
HICSS 2004 |
| 2003 |
| 15 |  | Ilan Adler,
Hyun-Soo Ahn,
Richard M. Karp,
Sheldon M. Ross:
Coalescing times for IID random variables with applications to population biology.
Random Struct. Algorithms 23(2): 155-166 (2003) |
| 2001 |
| 14 |  | Ilan Adler,
Noga Alon,
Sheldon M. Ross:
On the maximum number of Hamiltonian paths in tournaments.
Random Struct. Algorithms 18(3): 291-296 (2001) |
| 1994 |
| 13 |  | Ilan Adler,
Peter A. Beling:
Polynomial Algorithms for Linear Programming over the Algebraic Numbers.
Algorithmica 12(6): 436-457 (1994) |
| 1993 |
| 12 |  | Ilan Adler,
Alan J. Hoffman,
Ron Shamir:
Monge and Feasibility Sequences in General Flow Problems.
Discrete Applied Mathematics 44(1-3): 21-38 (1993) |
| 11 |  | Ilan Adler,
Ron Shamir:
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio.
Math. Program. 61: 39-52 (1993) |
| 1992 |
| 10 |  | Ilan Adler,
Peter A. Beling:
Polynomial Algorithms for Linear Programming over the Algebraic Numbers
STOC 1992: 483-494 |
| 9 |  | Ilan Adler,
Renato D. C. Monteiro:
A Geometric View of Parametric Linear Programming.
Algorithmica 8(2): 161-176 (1992) |
| 8 |  | Ilan Adler,
Peter A. Beling:
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices.
Math. Program. 57: 121-143 (1992) |
| 1991 |
| 7 |  | Ilan Adler,
Peter A. Beling:
Polynomial Algorithms for LP over a Subring of the Algebraic Integers with Applications to LP with Circulant Matrices
FOCS 1991: 480-487 |
| 6 |  | Ilan Adler,
Renato D. C. Monteiro:
Limiting behavior of the affine scaling continuous trajectories for linear programming problems.
Math. Program. 50: 29-51 (1991) |
| 1990 |
| 5 |  | Ilan Adler,
Steven Cosares:
Advantageous Properties of Dual Transhipment Polyhedra.
SIAM J. Discrete Math. 3(2): 157-167 (1990) |
| 1989 |
| 4 |  | Ilan Adler,
Narendra Karmarkar,
Mauricio G. C. Resende,
Geraldo Veiga:
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm.
INFORMS Journal on Computing 1(2): 84-106 (1989) |
| 1987 |
| 3 |  | Ilan Adler,
Richard M. Karp,
Ron Shamir:
A simplex variant solving an m times d linear program in O(min(m2, d2) expected number of pivot steps.
J. Complexity 3(4): 372-387 (1987) |
| 1985 |
| 2 |  | Ilan Adler,
Nimrod Megiddo:
A Simplex Algorithm Whose Average Number of Steps Is Bounded between Two Quadratic Functions of the Smaller Dimension
J. ACM 32(4): 871-895 (1985) |
| 1984 |
| 1 |  | Ilan Adler,
Nimrod Megiddo:
A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller Dimension
STOC 1984: 312-323 |