Ilan Adler

From MaRDI portal
Revision as of 12:46, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:344958

Available identifiers

zbMath Open adler.ilanMaRDI QIDQ344958

List of research outcomes





PublicationDate of PublicationType
Diameters of cocircuit graphs of oriented matroids: an update2022-04-04Paper
New Proximal Newton-Type Methods for Convex Optimization2020-07-18Paper
Some LCPs solvable in strongly polynomial time with Lemke's algorithm2016-11-25Paper
https://portal.mardi4nfdi.de/entity/Q54203452014-06-12Paper
On Simplex Pivoting Rules and Complexity Theory2014-06-02Paper
The equivalence of linear programs and zero-sum games2013-03-04Paper
A Note on Strictly Competitive Games2009-12-09Paper
Modeling and Computing Two-Settlement Oligopolistic Equilibrium in a Congested Electricity Network2009-08-13Paper
New characterizations of row sufficient matrices2009-06-04Paper
Two-settlement electricity markets with price caps and Cournot generation firms2007-05-03Paper
Distribution of the Time of the First k-Record2006-09-22Paper
A probabilistic model for the survivability of cells2006-06-29Paper
Sufficient matrices belong to \(L\).2006-05-02Paper
The coupon-collector's problem revisited2003-11-17Paper
Coalescing times for IID random variables with applications to population biology2003-11-10Paper
The coupon subset collection problem2002-10-07Paper
https://portal.mardi4nfdi.de/entity/Q43301312002-05-15Paper
On the maximum number of Hamiltonian paths in tournaments2002-03-29Paper
https://portal.mardi4nfdi.de/entity/Q45272082001-07-19Paper
Arbitrage and Growth Rate for Riskless Investments in a Stationary Economy1998-04-05Paper
Polynomial algorithms for linear programming over the algebraic numbers1995-02-28Paper
Monge and feasibility sequences in general flow problems1994-01-23Paper
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices1993-12-20Paper
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio1993-12-06Paper
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm1993-01-16Paper
A geometric view of parametric linear programming1992-09-27Paper
A Strongly Polynomial Algorithm for a Special Class of Linear Programs1992-09-26Paper
Limiting behavior of the affine scaling continuous trajectories for linear programming problems1991-01-01Paper
A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension1990-01-01Paper
Advantageous Properties of Dual Transhipment Polyhedra1990-01-01Paper
An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52028411990-01-01Paper
Interior path following primal-dual algorithms. I: Linear programming1989-01-01Paper
Interior path following primal-dual algorithms. II: Convex quadratic programming1989-01-01Paper
An implementation of Karmarkar's algorithm for linear programming1989-01-01Paper
A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps1987-01-01Paper
A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only1986-01-01Paper
A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension1985-01-01Paper
New results on the average behavior of simplex algorithms1984-01-01Paper
The max-flow problem with parametric capacities1979-01-01Paper
Long Monotone Paths in Abstract Polytopes1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41230771974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41787771974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41787781974-01-01Paper

Research outcomes over time

This page was built for person: Ilan Adler