Publication | Date of Publication | Type |
---|
Diameters of cocircuit graphs of oriented matroids: an update | 2022-04-04 | Paper |
New Proximal Newton-Type Methods for Convex Optimization | 2020-07-18 | Paper |
Some LCPs solvable in strongly polynomial time with Lemke's algorithm | 2016-11-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q5420345 | 2014-06-12 | Paper |
On Simplex Pivoting Rules and Complexity Theory | 2014-06-02 | Paper |
The equivalence of linear programs and zero-sum games | 2013-03-04 | Paper |
A Note on Strictly Competitive Games | 2009-12-09 | Paper |
Modeling and Computing Two-Settlement Oligopolistic Equilibrium in a Congested Electricity Network | 2009-08-13 | Paper |
New characterizations of row sufficient matrices | 2009-06-04 | Paper |
Two-settlement electricity markets with price caps and Cournot generation firms | 2007-05-03 | Paper |
Distribution of the Time of the First k-Record | 2006-09-22 | Paper |
A probabilistic model for the survivability of cells | 2006-06-29 | Paper |
Sufficient matrices belong to \(L\). | 2006-05-02 | Paper |
The coupon-collector's problem revisited | 2003-11-17 | Paper |
Coalescing times for IID random variables with applications to population biology | 2003-11-10 | Paper |
The coupon subset collection problem | 2002-10-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q4330131 | 2002-05-15 | Paper |
On the maximum number of Hamiltonian paths in tournaments | 2002-03-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4527208 | 2001-07-19 | Paper |
Arbitrage and Growth Rate for Riskless Investments in a Stationary Economy | 1998-04-05 | Paper |
Polynomial algorithms for linear programming over the algebraic numbers | 1995-02-28 | Paper |
Monge and feasibility sequences in general flow problems | 1994-01-23 | Paper |
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices | 1993-12-20 | Paper |
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio | 1993-12-06 | Paper |
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm | 1993-01-16 | Paper |
A geometric view of parametric linear programming | 1992-09-27 | Paper |
A Strongly Polynomial Algorithm for a Special Class of Linear Programs | 1992-09-26 | Paper |
Limiting behavior of the affine scaling continuous trajectories for linear programming problems | 1991-01-01 | Paper |
A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension | 1990-01-01 | Paper |
Advantageous Properties of Dual Transhipment Polyhedra | 1990-01-01 | Paper |
An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5202841 | 1990-01-01 | Paper |
Interior path following primal-dual algorithms. I: Linear programming | 1989-01-01 | Paper |
Interior path following primal-dual algorithms. II: Convex quadratic programming | 1989-01-01 | Paper |
An implementation of Karmarkar's algorithm for linear programming | 1989-01-01 | Paper |
A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps | 1987-01-01 | Paper |
A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only | 1986-01-01 | Paper |
A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension | 1985-01-01 | Paper |
New results on the average behavior of simplex algorithms | 1984-01-01 | Paper |
The max-flow problem with parametric capacities | 1979-01-01 | Paper |
Long Monotone Paths in Abstract Polytopes | 1976-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4123077 | 1974-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4178777 | 1974-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4178778 | 1974-01-01 | Paper |