| Publication | Date of Publication | Type |
|---|
New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures
Operations Research | 1989-01-01 | Paper |
A network-related nuclear power plant model with an intelligent branch- and-bound solution approach
Annals of Operations Research | 1989-01-01 | Paper |
A modeling/solution approach for optimal deployment of a weapons arsenal
Annals of Operations Research | 1989-01-01 | Paper |
Layering strategies for creating exploitable structure in linear and integer programs
Mathematical Programming. Series A. Series B | 1988-01-01 | Paper |
Equitable Demand Adjustment for Infeasible Transportation Problems
The Journal of the Operational Research Society | 1988-01-01 | Paper |
Microcomputer-based algorithms for large scale shortest path problems
Discrete Applied Mathematics | 1986-01-01 | Paper |
Threshold assignment algorithm
Mathematical Programming Studies | 1986-01-01 | Paper |
Implementation and analysis of alternative algorithms for generalized shortest path problems
Computers & Operations Research | 1985-01-01 | Paper |
A New Polynomially Bounded Shortest Path Algorithm
Operations Research | 1985-01-01 | Paper |
Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
Mathematical Programming Essays in Honor of George B. Dantzig Part I | 1985-01-01 | Paper |
New Polynomial Shortest Path Algorithms and Their Computational Attributes
Management Science | 1985-01-01 | Paper |
A primal simplex variant for the maximum-flow problem
Naval Research Logistics Quarterly | 1984-01-01 | Paper |
A note on specialized versus unspecialized methods for maximum-flow problems
Naval Research Logistics Quarterly | 1984-01-01 | Paper |
An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems
European Journal of Operational Research | 1984-01-01 | Paper |
An efficient primal approach to bottleneck transportation problems
Naval Research Logistics Quarterly | 1983-01-01 | Paper |
A comparison of pivot selection rules for primal simplex based network codes
Operations Research Letters | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3852385 (Why is no real title available?) | 1982-01-01 | Paper |
Recent Developments in Computer Implementation Technology for Network Flow Algorithms
INFOR: Information Systems and Operational Research | 1982-01-01 | Paper |
A New Optimization Method for Large Scale Fixed Charge Transportation Problems
Operations Research | 1981-01-01 | Paper |
The simplex SON algorithm for LP/embedded network problems
Mathematical Programming Studies | 1981-01-01 | Paper |
Implementation and analysis of a variant of the dual method for the capacitated transshipment problem
European Journal of Operational Research | 1980-01-01 | Paper |
An extended abstract of an indepth algorithmic and computational study for maximum flow problems
Discrete Applied Mathematics | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3668353 (Why is no real title available?) | 1980-01-01 | Paper |
An evaluation of mathematical programming and minicomputers
European Journal of Operational Research | 1979-01-01 | Paper |
A o(n logn) algorithm for LP knapsacks with GUB constraints
Mathematical Programming | 1979-01-01 | Paper |
A Strongly Convergent Primal Simplex Algorithm for Generalized Networks
Mathematics of Operations Research | 1979-01-01 | Paper |
Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
INFOR: Information Systems and Operational Research | 1979-01-01 | Paper |
Solving singularly constrained generalized network problems
Applied Mathematics and Optimization | 1978-01-01 | Paper |
The generalized alternating path algorithm for transportation problems
European Journal of Operational Research | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3670204 (Why is no real title available?) | 1978-01-01 | Paper |
A streamlined simplex approach to the singly constrained transportation problem
Naval Research Logistics Quarterly | 1978-01-01 | Paper |
Finding Equivalent Network Formulations for Constrained Network Problems
Management Science | 1977-01-01 | Paper |
The alternating basis algorithm for assignment problems
Mathematical Programming | 1977-01-01 | Paper |
Improved convexity cuts for lattice point problems
Journal of Optimization Theory and Applications | 1976-01-01 | Paper |
Explicit Solutions in Convex Goal Programming
Management Science | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3523333 (Why is no real title available?) | 1976-01-01 | Paper |
An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks
Operations Research | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3573619 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3614523 (Why is no real title available?) | 1976-01-01 | Paper |
A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems
Journal of the ACM | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3485511 (Why is no real title available?) | 1975-01-01 | Paper |
Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently
ACM Transactions on Mathematical Software | 1975-01-01 | Paper |
Solving Constrained Transportation Problems
Operations Research | 1975-01-01 | Paper |
Optimal Weighted Ancestry Relationships
Management Science | 1974-01-01 | Paper |
An improved version of the out-of-kilter method and a comparative study of computer codes
Mathematical Programming | 1974-01-01 | Paper |
The Transportation Problem with Mixed Constraints
The Journal of the Operational Research Society | 1974-01-01 | Paper |
The Generalized Lattice-Point Problem
Operations Research | 1973-01-01 | Paper |
On the equivalence of some generalized network problems to pure network problems
Mathematical Programming | 1973-01-01 | Paper |
Concave Programming Applied to a Special Class of 0-1 Integer Programs
Operations Research | 1973-01-01 | Paper |
Higher Order Tree Dual Approximation Methods for the Distribution Problem
Management Science | 1972-01-01 | Paper |
Basic Dual Feasible Solutions for a Class of Generalized Networks
Operations Research | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3337321 (Why is no real title available?) | 1971-01-01 | Paper |
The lower bounded and partial upper bounded distribution model
Naval Research Logistics Quarterly | 1971-01-01 | Paper |
Note—The Distribution Problem with Upper and Lower Bounds on the Node Requirements
Management Science | 1970-01-01 | Paper |
