
person
Klingman
Related items of Klingman
reports -- #212 Solving Singularly Constrained Transshipment Problems
-
reports -- #218 Improved Labeling of L.P. Bases in Networks
-
reports -- #238 Capsule View of Future Developments on Large Scale Network and Network-Related Problems
-
reports -- #247 Network Application in Industry and Government
-
reports -- #256 Solving Singularly Constrained Generalized Network Problems
-
reports -- #257 Solving Constrained Generalized Network Problems
-
reports -- #262 Enhancements of Spanning Tree Labeling Procedures for Network Optimization
-
reports -- #263 The Alternating Basis Algorithm for Assignment Problems
-
reports -- #264 A New Alternating Basis Algorithm for Semi-Assignment Networks
-
reports -- #267 Implementation of Large-Scale Financial Planning Models: Solution Efficient Transformations
-
reports -- #270 Some Recent Practical Misconceptions About the State of the Art of Network Algorithms
-
reports -- #273 An 0 (n (log n + log m) ) Algorithm for LP Knapsacks with Gub Constraints
-
reports -- #273 An 0 (n (log n + log m) ) Algorithm for LP Knapsacks with Gub Constraints
-
reports -- #281 The Netform Concept: A More Effective Model Form and Solution Procedure for Large Scale Nonlinear Problems
-
reports -- #282 The Generalized Alternating Path Algorithm for Transportation Problems
-
reports -- #286 Planning in the Multinational Firm: The Strategic Operations Interface