Person:1072450

Available identifiers

zbMath Open klingman.darwin-dMaRDI QIDQ1072450

List of research outcomes

Publication	Date of Publication	Type
A network-related nuclear power plant model with an intelligent branch- and-bound solution approach	1989-01-01	Paper
A modeling/solution approach for optimal deployment of a weapons arsenal	1989-01-01	Paper
New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures	1989-01-01	Paper
Layering strategies for creating exploitable structure in linear and integer programs	1988-01-01	Paper
Equitable Demand Adjustment for Infeasible Transportation Problems	1988-01-01	Paper
Microcomputer-based algorithms for large scale shortest path problems	1986-01-01	Paper
Threshold assignment algorithm	1986-01-01	Paper
Implementation and analysis of alternative algorithms for generalized shortest path problems	1985-01-01	Paper
A New Polynomially Bounded Shortest Path Algorithm	1985-01-01	Paper
Basis exchange characterizations for the simplex son algorithm for LP/embedded networks	1985-01-01	Paper
New Polynomial Shortest Path Algorithms and Their Computational Attributes	1985-01-01	Paper
An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems	1984-01-01	Paper
A primal simplex variant for the maximum-flow problem	1984-01-01	Paper
A note on specialized versus unspecialized methods for maximum-flow problems	1984-01-01	Paper
A comparison of pivot selection rules for primal simplex based network codes	1983-01-01	Paper
An efficient primal approach to bottleneck transportation problems	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3321412	1982-01-01	Paper
Recent Developments in Computer Implementation Technology for Network Flow Algorithms	1982-01-01	Paper
A New Optimization Method for Large Scale Fixed Charge Transportation Problems	1981-01-01	Paper
The simplex SON algorithm for LP/embedded network problems	1981-01-01	Paper
Implementation and analysis of a variant of the dual method for the capacitated transshipment problem	1980-01-01	Paper
An extended abstract of an indepth algorithmic and computational study for maximum flow problems	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3865868	1980-01-01	Paper
An evaluation of mathematical programming and minicomputers	1979-01-01	Paper
A o(n logn) algorithm for LP knapsacks with GUB constraints	1979-01-01	Paper
A Strongly Convergent Primal Simplex Algorithm for Generalized Networks	1979-01-01	Paper
Enhancements Of Spanning Tree Labelling Procedures For Network Optimization	1979-01-01	Paper
Solving singularly constrained generalized network problems	1978-01-01	Paper
The generalized alternating path algorithm for transportation problems	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3867579	1978-01-01	Paper
A streamlined simplex approach to the singly constrained transportation problem	1978-01-01	Paper
Finding Equivalent Network Formulations for Constrained Network Problems	1977-01-01	Paper
The alternating basis algorithm for assignment problems	1977-01-01	Paper
Improved convexity cuts for lattice point problems	1976-01-01	Paper
Explicit Solutions in Convex Goal Programming	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4101626	1976-01-01	Paper
An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4145448	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4178800	1976-01-01	Paper
A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4068469	1975-01-01	Paper
Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently	1975-01-01	Paper
Solving Constrained Transportation Problems	1975-01-01	Paper
Optimal Weighted Ancestry Relationships	1974-01-01	Paper
An improved version of the out-of-kilter method and a comparative study of computer codes	1974-01-01	Paper
The Transportation Problem with Mixed Constraints	1974-01-01	Paper
The Generalized Lattice-Point Problem	1973-01-01	Paper
On the equivalence of some generalized network problems to pure network problems	1973-01-01	Paper
Concave Programming Applied to a Special Class of 0-1 Integer Programs	1973-01-01	Paper
Higher Order Tree Dual Approximation Methods for the Distribution Problem	1972-01-01	Paper
Basic Dual Feasible Solutions for a Class of Generalized Networks	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5614361	1971-01-01	Paper
The lower bounded and partial upper bounded distribution model	1971-01-01	Paper
Note—The Distribution Problem with Upper and Lower Bounds on the Node Requirements	1970-01-01	Paper

Research outcomes over time

This page was built for person: Darwin D. Klingman