Michel Bénichou

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ Some Basic Techniques for Solving Sparse Systems of Linear Equations 1972 Fred G. Gustavson
1
+ Advanced Linear-Programming Computing Techniques 1968 W. Orchard-Hays
1
+ A FAST, STABLE IMPLEMENTATION OF THE SIMPLEX METHOD USING BARTELS-GOLUB UPDATING††Research for this paper was supported by the Energy Research and Development Administration Contract AT(04-3)-326 PA #18, at Stanford University. 1976 Michael A. Saunders
1
+ Pivoting for Size and Sparsity in Linear Programming Inversion Routes 1972 John A. Tomlin
1
+ Partially normalized pivot selection in linear programming 1975 Harlan Crowder
J.M. Hattingh
1
+ Experiments in mixed-integer linear programming 1971 M. Benichou
J. M. Gauthier
P. Girodet
G. Hentges
G. Ribière
O. Vincent
1
+ Experiments in mixed-integer linear programming using pseudo-costs 1977 J. M. Gauthier
G. Ribière
1
+ A Technique for Resolving Degeneracy in Linear Programming 1963 Philip Wolfe
1
+ PDF Chat Some results on sparse matrices 1970 Robert K. Brayton
Fred G. Gustavson
Ralph A. Willoughby
1
+ PDF Chat The simplex method of linear programming using LU decomposition 1969 Richard H. Bartels
Gene H. Golub
1
+ On pricing and backward transformation in linear programming 1974 J. A. Tomlin
1
+ The Elimination form of the Inverse and its Application to Linear Programming 1957 Harry M. Markowitz
1
+ Integer Programming Algorithms: A Framework and State-of-the-Art Survey 1972 Arthur M. Geoffrion
Roy E. Marsten
1
+ PDF Chat Advanced Linear-Programming Computing Techniques 1969 Garrett Morris
1
+ On scaling linear programming problems 1975 John A. Tomlin
1
+ SPARSE MATRIX TECHNIQUES IN TWO MATHEMATICAL PROGRAMMING CODES 1969 George B. Dantzig
R. P. Harvey
R. D. McKnight
Arnell S. Forde
1