The (Dantzig) simplex method for linear programming
John C. Nash · Computing in Science & Engineering · 2000
In 1947, George Dantzig created a simplex algorithm to solve linear programs for planning and decision-making in large-scale enterprises. The algorithm's success led to a vast array of specializations and generalizations that have dominated practical operations research for half a century.
Cited by 124 works. doi:10.1109/5992.814654