The following pages link to Richard S. Barr (Q1066816):
Displaying 21 items.
- Reoptimization procedures for bounded variable primal simplex network algorithms (Q1066818) (← links)
- (Q1245651) (redirect page) (← links)
- The generalized alternating path algorithm for transportation problems (Q1245652) (← links)
- Parallel and hierarchical decomposition approaches for solving large-scale data envelopment analysis models (Q1374270) (← links)
- Minimal spanning trees: An empirical investigation of parallel algorithms (Q1823705) (← links)
- Designing and reporting on computational experiments with heuristic methods (Q1922625) (← links)
- (Q3374056) (← links)
- (Q3865868) (← links)
- (Q3867579) (← links)
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems (Q3904373) (← links)
- Microdata file merging through large-scale network technology (Q3934139) (← links)
- An improved version of the out-of-kilter method and a comparative study of computer codes (Q4073126) (← links)
- The alternating basis algorithm for assignment problems (Q4159200) (← links)
- Enhancements Of Spanning Tree Labelling Procedures For Network Optimization (Q4189072) (← links)
- Feature Article—Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions (Q4202468) (← links)
- Network Reoptimization Algorithms: A Statistically Designed Comparison (Q4282271) (← links)
- Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup (Q4287600) (← links)
- (Q4352230) (← links)
- (Q5294074) (← links)
- The invisible‐hand heuristic for origin‐destination integer multicommodity network flows (Q6065841) (← links)
- An extreme‐point tabu‐search algorithm for fixed‐charge network problems (Q6087082) (← links)
