Letter to the Editor - A Note on a Distribution Problem. - Abraham Charnes; Fred W. Glover; Darwin Klingman (Oper. Res., 1970)

Basic Dual Feasible Solutions for a Class of Generalized Networks. - Fred W. Glover; Darwin Klingman; H. Albert Napier (Oper. Res., 1972)

A note on computational studies for solving transportation problems. - Fred W. Glover; David Karney; Darwin Klingman (ACM Annual Conference, 1973)

Concave Programming Applied to a Special Class of 0-1 Integer Programs. - Fred W. Glover; Darwin Klingman (Oper. Res., 1973)

The Generalized Lattice-Point Problem. - Fred W. Glover; Darwin Klingman (Oper. Res., 1973)

On the equivalence of some generalized network problems to pure network problems. - Fred W. Glover; Darwin Klingman (Math. Program., 1973)

The Disjunctive-Facet Problem: Formulation and Solution Techniques. - Fred W. Glover; Darwin Klingman; Joel David Stutz (Oper. Res., 1974)

An improved version of the out-of-kilter method and a comparative study of computer codes. - Richard S. Barr; Fred W. Glover; Darwin Klingman (Math. Program., 1974)

Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems. - Fred W. Glover; David Karney; Darwin Klingman (Networks, 1974)

New Developments in Network Optimization and their Application in Industry and Government. - Darwin Klingman (WG, 1975)

Past, present and future of large scale transshipment computer codes and applications. - Abraham Charnes; David Karney; Darwin Klingman; Joel David Stutz; Fred W. Glover (Comput. Oper. Res., 1975)

Solving Constrained Transportation Problems. - Darwin Klingman; Robert Russell (Oper. Res., 1975)

A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems. - G. Terry Ross; Darwin Klingman; H. Albert Napier (J. ACM, 1975)

Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently. - Fred W. Glover; Darwin Klingman (ACM Trans. Math. Softw., 1975)

A practitioner's guide to the state of large scale network and network-related problems. - Fred W. Glover; Darwin Klingman (AFIPS National Computer Conference, 1976)

An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks. - John W. Hultz; Darwin D. Klingman; Robert Russell (Oper. Res., 1976)

Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code. - David Karney; Darwin Klingman (Oper. Res., 1976)

A Cotton Ginning Problem. - Darwin Klingman; Paul H. Randolph; Stephen W. Fuller (Oper. Res., 1976)

The NETFORM concept: A more effective model form and solution procedure for large scale nonlinear problems. - Fred W. Glover; Claude McMillan; Darwin Klingman (ACM Annual Conference, 1977)

The alternating basis algorithm for assignment problems. - Richard S. Barr; Fred W. Glover; Darwin Klingman (Math. Program., 1977)

Letter to the Editor - Comments on a Note by Hatch on Network Algorithms. - Fred W. Glover; Darwin Klingman (Oper. Res., 1978)

A Strongly Convergent Primal Simplex Algorithm for Generalized Networks. - Joyce J. Elam; Fred W. Glover; Darwin Klingman (Math. Oper. Res., 1979)

A o(n logn) algorithm for LP knapsacks with GUB constraints. - Fred W. Glover; Darwin Klingman (Math. Program., 1979)

A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. - R. Dial; Fred W. Glover; David Karney; Darwin Klingman (Networks, 1979)

An extended abstract of an indepth algorithmic and computational study for maximum flow problems. - Fred W. Glover; Darwin Klingman; John Mote; David Whitman (Discret. Appl. Math., 1980)

An interactive computer system for multicriteria facility location. - John W. Hultz; Darwin D. Klingman; G. Terry Ross; Richard M. Soland (Comput. Oper. Res., 1981)

A New Optimization Method for Large Scale Fixed Charge Transportation Problems. - Richard S. Barr; Fred W. Glover; Darwin Klingman (Oper. Res., 1981)

Computational study of an improved shortest path algorithm. - Fred W. Glover; Randy Glover; Darwin Klingman (Networks, 1984)

Implementation and analysis of alternative algorithms for generalized shortest path problems. - Darwin D. Klingman; Ronald D. Armstrong; Parviz Partow-Navid (Comput. Oper. Res., 1985)

A New Polynomially Bounded Shortest Path Algorithm. - Fred W. Glover; Darwin Klingman; Nancy V. Phillips (Oper. Res., 1985)

Microcomputer-based algorithms for large scale shortest path problems. - Darwin D. Klingman; Robert F. Schneider (Discret. Appl. Math., 1986)

OR Practice - A Logistics Planning System at W. R. Grace. - Darwin Klingman; John Mote; Nancy V. Phillips (Oper. Res., 1988)

Layering strategies for creating exploitable structure in linear and integer programs. - Fred W. Glover; Darwin Klingman (Math. Program., 1988)

New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures. - Fred W. Glover; Darwin Klingman (Oper. Res., 1989)

Network models in optimization and their applications in practice. - Fred W. Glover; Darwin Klingman; Nancy V. Phillips (Wiley, 1992)