D. Karney
The University of Texas at Austin · 18 works · 1,202 citations · h-index 12
Top works
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- A Collection of Matrices for Testing Computational Algorithms
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- The Augmented Predecessor Index Method for Locating Stepping-Stone Paths and Assigning Dual Prices in Distribution Problems
- Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problems
- Double-Pricing Dual and Feasible Start Algorithms for the Capacitated Transportation (Distribution) Problem
- An Integrated Production, Distribution, and Inventory Planning System
- Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
- Solving Singly Constrained Transshipment Problems
- Past, present and future of large scale transshipment computer codes and applications
- A note on computational studies for solving transportation problems
- A Study of Alternative Relaxation Approaches for a Manpower Planning Problem††This research was partly supported by ONR Contract N00014-76-C-0383 with Decision Analysis and Research Institute and by Project NR047-021, ONR Contracts N00014-75-C-0616 and N00014-75-C-0569 with the Center for Cybernetic Studies, The University of Texas.
- Past, Present and Future of Development, Computational Efficiency, and Practical Use of Large Scale Transportation and Transhipment Computer Codes
- A Comparison of Computation Times for Various Starting Procedures, Basis Change Criteria, and Solution Algorithms for Distribution Problems
- Solving Singularly Constrained Transshipment Problems
- Shortest path forest with topological ordering: An algorithm description in SDL
- A Policy Evaluation Model and Prototype Computer-Assisted Policy Evaluation System for Naval Personnel Management.
- List of Contributors