| Publication | Date of Publication | Type |
|---|
A generalization of von Neumann's reduction from the assignment problem to zero-sum games
Games and Economic Behavior | 2026-03-24 | Paper |
Diameters of cocircuit graphs of oriented matroids: an update
The Electronic Journal of Combinatorics | 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
Mathematical Programming. Series A. Series B | 2016-11-25 | Paper |
| Score probabilities for serve and rally competitions | 2014-06-12 | Paper |
On Simplex Pivoting Rules and Complexity Theory
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
The equivalence of linear programs and zero-sum games
International Journal of Game Theory | 2013-03-04 | Paper |
A Note on Strictly Competitive Games
Lecture Notes in Computer Science | 2009-12-09 | Paper |
Modeling and Computing Two-Settlement Oligopolistic Equilibrium in a Congested Electricity Network
Operations Research | 2009-08-13 | Paper |
New characterizations of row sufficient matrices
Linear Algebra and its Applications | 2009-06-04 | Paper |
Two-settlement electricity markets with price caps and Cournot generation firms
European Journal of Operational Research | 2007-05-03 | Paper |
Distribution of the Time of the First k-Record
Probability in the Engineering and Informational Sciences | 2006-09-22 | Paper |
A probabilistic model for the survivability of cells
Journal of Applied Probability | 2006-06-29 | Paper |
Sufficient matrices belong to \(L\).
Mathematical Programming. Series A. Series B | 2006-05-02 | Paper |
The coupon-collector's problem revisited
Journal of Applied Probability | 2003-11-17 | Paper |
Coalescing times for IID random variables with applications to population biology
Random Structures & Algorithms | 2003-11-10 | Paper |
The coupon subset collection problem
Journal of Applied Probability | 2002-10-07 | Paper |
| scientific article; zbMATH DE number 1741798 (Why is no real title available?) | 2002-05-15 | Paper |
On the maximum number of Hamiltonian paths in tournaments
Random Structures & Algorithms | 2002-03-29 | Paper |
| scientific article; zbMATH DE number 1560356 (Why is no real title available?) | 2001-07-19 | Paper |
Arbitrage and Growth Rate for Riskless Investments in a Stationary Economy
Mathematical Finance | 1998-04-05 | Paper |
Polynomial algorithms for linear programming over the algebraic numbers
Algorithmica | 1995-02-28 | Paper |
Monge and feasibility sequences in general flow problems
Discrete Applied Mathematics | 1994-01-23 | Paper |
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
Mathematical Programming. Series A. Series B | 1993-12-20 | Paper |
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
Mathematical Programming. Series A. Series B | 1993-12-06 | Paper |
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
ORSA Journal on Computing | 1993-01-16 | Paper |
A geometric view of parametric linear programming
Algorithmica | 1992-09-27 | Paper |
A Strongly Polynomial Algorithm for a Special Class of Linear Programs
Operations Research | 1992-09-26 | Paper |
Limiting behavior of the affine scaling continuous trajectories for linear programming problems
Mathematical Programming. Series A. Series B | 1991-01-01 | Paper |
An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
Mathematics of Operations Research | 1990-01-01 | Paper |
A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
Mathematics of Operations Research | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4197742 (Why is no real title available?) | 1990-01-01 | Paper |
Advantageous Properties of Dual Transhipment Polyhedra
SIAM Journal on Discrete Mathematics | 1990-01-01 | Paper |
Interior path following primal-dual algorithms. II: Convex quadratic programming
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
Interior path following primal-dual algorithms. I: Linear programming
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
An implementation of Karmarkar's algorithm for linear programming
Mathematical Programming. Series A. Series B | 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
Journal of Complexity | 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
Mathematics of Operations Research | 1986-01-01 | Paper |
A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
Journal of the ACM | 1985-01-01 | Paper |
New results on the average behavior of simplex algorithms
Bulletin of the American Mathematical Society | 1984-01-01 | Paper |
The max-flow problem with parametric capacities
Discrete Applied Mathematics | 1979-01-01 | Paper |
Long Monotone Paths in Abstract Polytopes
Mathematics of Operations Research | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3614497 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3548722 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3614496 (Why is no real title available?) | 1974-01-01 | Paper |
