The following pages link to Darwin D. Klingman (Q1072450):
Displayed 50 items.
- Item:Q1072450 (redirect page) (← links)
- Item:Q792214 (redirect page) (← links)
- An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems (Q792216) (← links)
- A comparison of pivot selection rules for primal simplex based network codes (Q794141) (← links)
- A network-related nuclear power plant model with an intelligent branch- and-bound solution approach (Q917441) (← links)
- A modeling/solution approach for optimal deployment of a weapons arsenal (Q918402) (← links)
- Microcomputer-based algorithms for large scale shortest path problems (Q1072451) (← links)
- Implementation and analysis of alternative algorithms for generalized shortest path problems (Q1086499) (← links)
- Layering strategies for creating exploitable structure in linear and integer programs (Q1117840) (← links)
- Implementation and analysis of a variant of the dual method for the capacitated transshipment problem (Q1143947) (← links)
- An extended abstract of an indepth algorithmic and computational study for maximum flow problems (Q1148822) (← links)
- Improved convexity cuts for lattice point problems (Q1218339) (← links)
- Solving singularly constrained generalized network problems (Q1245161) (← links)
- The generalized alternating path algorithm for transportation problems (Q1245652) (← links)
- An evaluation of mathematical programming and minicomputers (Q1250035) (← links)
- A primal simplex variant for the maximum-flow problem (Q3316928) (← links)
- A note on specialized versus unspecialized methods for maximum-flow problems (Q3316929) (← links)
- (Q3321412) (← links)
- An efficient primal approach to bottleneck transportation problems (Q3671756) (← links)
- A New Polynomially Bounded Shortest Path Algorithm (Q3701214) (← links)
- Basis exchange characterizations for the simplex son algorithm for LP/embedded networks (Q3710290) (← links)
- Threshold assignment algorithm (Q3743115) (← links)
- New Polynomial Shortest Path Algorithms and Their Computational Attributes (Q3750535) (← links)
- Equitable Demand Adjustment for Infeasible Transportation Problems (Q3789334) (← links)
- New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures (Q3833887) (← links)
- A o(n logn) algorithm for LP knapsacks with GUB constraints (Q3854926) (← links)
- A Strongly Convergent Primal Simplex Algorithm for Generalized Networks (Q3856449) (← links)
- (Q3865868) (← links)
- (Q3867579) (← links)
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems (Q3904373) (← links)
- The simplex SON algorithm for LP/embedded network problems (Q3934137) (← links)
- Optimal Weighted Ancestry Relationships (Q4058496) (← links)
- A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems (Q4061870) (← links)
- (Q4068469) (← links)
- An improved version of the out-of-kilter method and a comparative study of computer codes (Q4073126) (← links)
- Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently (Q4073142) (← links)
- Solving Constrained Transportation Problems (Q4074660) (← links)
- Explicit Solutions in Convex Goal Programming (Q4094656) (← links)
- (Q4101626) (← links)
- Finding Equivalent Network Formulations for Constrained Network Problems (Q4127665) (← links)
- An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks (Q4136988) (← links)
- (Q4145448) (← links)
- The alternating basis algorithm for assignment problems (Q4159200) (← links)
- A streamlined simplex approach to the singly constrained transportation problem (Q4178779) (← links)
- (Q4178800) (← links)
- Enhancements Of Spanning Tree Labelling Procedures For Network Optimization (Q4189072) (← links)
- Recent Developments in Computer Implementation Technology for Network Flow Algorithms (Q4740300) (← links)
- The Transportation Problem with Mixed Constraints (Q4772969) (← links)
- The Generalized Lattice-Point Problem (Q5181531) (← links)
- Note—The Distribution Problem with Upper and Lower Bounds on the Node Requirements (Q5589734) (← links)
- (Q5614361) (← links)