Karney,D., Klingman,D., Glover,Fred, Napier,A.
New methods for accelerating the determination of basis trees and dual evaluators for distribution problems are compared with standard solution procedures in a computational study of a wide range of...
Convex Programming and Decomposition of Discrete Frequency Spectra. (2005)
Charnes,A., Crus-Abad,L., Klingman,D.
The decomposition of a given empirical frequency distribution into a finite mixture of distributions from an admissible class is posed as a convex programming problem. The convexity is attained with...
Solving Singularly Constrained Transshipment Problems. (2002)
Glover,Fred, Karney,D., Klingman,D., Russell,R.
This paper develops a primal simplex procedure to solve transshipment problems with an arbitrary additional constraint. The procedure incorporates efficient methods for pricing-out the basis,...
A New Computer-Based Planning Tool. (2002)
Glover,F., Hultz,J., Klingman,D., Stutz,J.
The purpose of this paper is to document this recent emergence of generalized networks as a fundamental computer-based planning tool and to demonstrate the power of the associated modeling and...
The Generalized Alternating Path Algorithm for Transportation Problems. (2002)
Barr,R. S., Glover,F., Klingman,D.
A new primal extreme point algorithm for solving capacitated transportation problems is developed in this paper. This algorithm, called the generalized alternating path (GAP) algorithm, is a special...
Planning in the Multinational Firm: The Strategic Operations Interface. (2002)
Crum,R. L., Klingman,D., Tavis,L. A.
Great environmental uncertainties have increased the importance of formal planning structures to assist multinational firms in adapting to a rapidly changing world. It is our belief that the type of...
On the Equivalence of Some Generalized Network Problems to Pure Network Problems. (1998)
The purpose of the paper is to show that any generalized network problem whose matrix does not have full row rank is equivalent to a pure network problem. Furthermore, the authors develop an...
The Disjunctive Facet Problem: Formulation and Solution Techniques. (1998)
Glover,F., Klingman,D., Stutz,J.
Many practical operations research problems have the form in which the objective is to select an optimal production schedule, rental policy, distribution pattern, etc., from among a variety of...
A Note on Finding All Shortest Paths. (1998)
Glover,Fred, Klingman,D., Napier,A.
The authors present a procedure for finding the shortest route between all pairs of nodes in a network. The approach is quite simple, but is highly efficient for a special class of network problems....
On Solving Constrained Transportation Problems, (1998)
The paper presents a computationally efficient method for solving transportation problems with several additional constraints. The method is basically the primal simplex method specialized to fully...
Glover,Fred, Karney,D., Klingman,D., Napier,A.
The paper presents an in-depth computational comparison of the basic solution algorithms for solving transportation problems. The comparison is performed using state of the art computer codes for the...
On Solving the Singularly Constrained Transportation Problem. (1998)
A primal simplex procedure is developed to solve transportation problems with an arbitrary additional constraint. The approach is a specialization of the Double Reverse Method of Charnes and Cooper....
Optimal Weighted Ancestry Relationships. (1998)
Glover,Fred, Klastorin,T., Klingman,D.
An efficient solution method is given for a class of practical optimization problems requiring the determination of a consistent partial ordering for sets of objects, events, preferences, etc. These...
An Improved Version of the Out-of-Kilter Method and a Comparative Study of Computer Codes. (1998)
Barr,R. S., Glover,F., Klingman,D.
The primary objectives of the paper are fourfold: To present an improved formulation of the out-of-kilter algorithm; To give the results of an extensive computational comparison of a code based on...
Glover,Fred, Karney,D., Klingman,D.
The primary objectives of this paper are: (1) to present a simplified 'double-pricing' method for solving the capacitated transportation problem by Lemke's dual method which streamlines computer...
Equivalence of Generalized Network and Generalized Transportation Problems. (1998)
Glover,Fred, Klingman,D., Napier,Al
The paper shows that any generalized network problem can be transformed into a generalized transportation problem. The approach extends earlier procedures for transforming pure network problems to...
Charnes,A., Glover,Fred, Karney,David, Klingman,D., Stutz,Joel
Three generations of computers have elapsed since the first satisfactory method for solving transportation and transhipment problems was devised. During this time many computational advances have...
Glover,F., Karney,D., Klingman,D.
The paper presents extensive computational experience with a special purpose primal simplex algorithm. The performance is compared to that of several 'state of the art' out-of-kilter computer codes....
Klingman,D., Napier,A., Ross,G. Terry
The paper presents an indepth study of the influence of problem structure on the computational efficiency of the primal simplex transportation algorithm. The input for the study included over 1000...
The Transportation Problem with Mixed Constraints. (1998)
A generalization of the standard transportation model in which the origin and destination constraints consist not only of equality but also of greater than or equal to or less than or equal to type...
Augmented Threaded Index Method for Network Optimization. (1998)
Glover,F., Klingman,D., Stutz,J.
Easily manipulated list structures for recording the basis tree for adjacent extreme point (simplex type) network algorithms are paramount to the development of computationally efficient network...
Implementation and Computational Study on an In-Core Out-of-Core Primal Network Code. (1998)
The paper presents extensive computational experience with a special purpose primal simplex code using the augmented threaded index method for solving pure network problems. This code is...
Explicit Solutions in Convex Goal Programming. (1998)
Charnes,A., Cooper,W. W., Klingman,D., Niehaus,R. J.
Goal programming has now become an important tool in areas such as public management science. There is therefore a need for examining ways of securing improved computational efficiency. Based on...
Some Advanced Start Procedures for Manpower Planning in Goal Programming Models. (1998)
Charnes,A., Cooper,W. W., Klingman,D., Niehaus,R. J.
Methods for securing advanced starts are detailed which secure basic feasible solutions without recourse to so-called Phase-One Procedures in Manpower Planning Models of Goal Programming variety. The...
Charnes,A., Cooper,W. W., Klingman,D., Niehaus,R.
It is shown that the biased quadratic problem in the static multiattribute case can be replaced by a single equivalent linear programming problem which is of classic assignment type. In the dynamic...
New Advances in the Solution of Large-Scale Network and Network-Related Problems. (1998)
Networks and network related problems occur with remarkable frequency in practical applications. Surprisingly, however, they often go unrecognized even by relatively seasoned modelers, who resort to...
Explicit Solutions in Convex Goal Programming. (1998)
Charnes,A., Cooper,W. W., Klingman,D., Niehaus,R. J.
Goal programming has now become an important tool in areas such as public management science. There is therefore a need for examining ways of securing improved computational efficiency, as is done in...
Network models and associated aplications / edited by D. Klingman and J.M. Mulvey (1981)
Baker, T.A, Mulvey, J.M. (John M.), Klingman, D. (Darwin)
Incluye bibliografía