HURIS® Skills Directory
- Operations Research ( OR )
- Operational Research
- Management Science ( MS )
- Management Science Methodologies
- Quantitative Tools & Techniques
- Problem-solving Methods
- Analytical Problem-solving
- Decision Science ( DS )
- Mathematical Decision Science ( MDS )
- Industrial Management
- Game Theory
- Probability Theory
- Estimation Theory
- Sequencing Theory
- Replacement Theory
- Linear Programming ( LP )
- Linear Programming - Asymptotic
- Simplex Method / Algorithm
- Simplex Method - Elementary
- Simplex Method - Lattice
- Simplex Method - Convex
- Stepping Stone Method / Algorithm
- Northwest Corner Method / Algorithm
- Vogel's Approximation Method ( VAM )
- Modified Distribution Method ( MODI )
- Modified Distribution Algorithm
- Sequencing Algorithm
- Sequencing Algorithm Optimization
- Branch & Bound Technique ( B&B )
- Nonlinear Programming ( NLP )
- Quadratic Programming ( QP )
- Dynamic Programming
- Dynamic Programming - Stochastic
- Optimization Methods
- Optimization, Linear
- Optimization, Nonlinear
- Optimization, Discrete
- Optimization, Network
- Optimization, Combinatorial
- Optimization, Fibonacci
- Optimization, Heuristic
- Optimization Algorithms
- Route Optimization
- Schedule Optimization
- Warehouse Optimization
- Sequence Optimization
- Blend Optimization
- Mix Optimization
- Optimal Search Theory
- Search Algorithm Optimization
- Search Algorithms
- Search, Directed Tree
- Search, Lattice
- Search, Nonlinear
- Search, Fibonacci- Leonardo, Pisa, 1200 AD
- Search, Scatter X
- Search, Asymptotic
- Search, Heuristic
- Search Techniques
- Out-of-Kilter Algorithm ( out of kilter )
- Linear & Nonlinear Techniques / Methods
- Linear & Nonlinear Algorithms
- Classical Operations Research Problems
- Alignment Problem
- Assembly Line Problem
- Assignment Problem
- Blending Problem
- Bottleneck Assignment Problem
- Bottleneck Transportation Problem
- Bottleneck Routing Problem
- Bottleneck Vehicle Routing Problem
- Capital Budgeting Problem
- Catering Problem
- Chinese Postman Problem
- Facility Location Problem
- Inventory Control Problem
- Knapsack Problem
- Knapsack Size Problem
- Lot Size Problem
- Maintenance Problem
- Manpower Planning Problem
- Manpower Routing Problem
- Matching Problem
- Maximum Flow Problem
- Newsboy Problem
- Node Packing Problem
- Node Packing Approximation Problem
- Packing Problem
- Partitioning Problem
- Pooling Problem
- Product Mix Problem
- Production Scheduling Problem
- Refinery Problem
- Refinery Pooling Problem
- Refinery Blending Problem
- Replacement Problem
- Routing Problem
- Sequencing Problem
- Set Packing Problem
- Set Packing Approximation Problem
- Spline Approximation Problem
- Transportation Problem
- Traveling Salesman Problem ( TSP )
- Traveling Salesman Problem - Euclidian
- Vehicle Routing Problem ( VRP )
- Warehouse Problem
- Warehouse Location Problem
- Warehouse Packing Problem
