OR Methods and Models
These papers have been cited by many other researchers, and they have been used to solve real-world problems using simplex method, Ford-Fulkerson algorithm, critical path method, Queueing theory and Stochastic models.
The Simplex Method
One of the most important classic academic papers in OR is “The Simplex Method” by George Dantzig (1947). This paper introduced the simplex method, which is a popular algorithm for solving linear programming problems. The simplex method is a simple and efficient way to solve linear programming problems, and it is still widely used today.
Linear Programming and The Transportation Problem
“Linear Programming” by George Dantzig (1947): This paper introduced the concept of linear programming, which is a mathematical technique for optimizing an objective function subject to a set of linear constraints.
An important classic academic paper in OR is “The Transportation Problem” by Ford and Fulkerson (1956). This paper introduced the Ford-Fulkerson algorithm, which is a popular algorithm for solving the transportation problem. The transportation problem is a special case of linear programming…
