Boros, Endre; Gurvich, Vladimir (June 2008). "Scientific contributions of Leo Khachiyan (a short overview)". Discrete Applied Mathematics. 156 (11): 2232–2240. doi:10.1016/j.dam.2008.04.023.
Khachiyan's linear programming algorithm☆ 1980
In 1979, Khachiyan found an efficient way to solve programming problems that were thought to be intractable because they dealt with an often astronomically large number of options. His breakthrough dealt with the underlying mathematics to find the best of a finite but huge number of choices a computer can pursue. Applications today extend to a wide variety of areas, including telecommunications, economics, biology and agriculture.[1]
So what did Khachiyan’s discovery of a new algorithm do to linear programming and combinatorial optimization? Personally, I feel his algorithm turned these subjects into more rigorous, more respectable, and more popular disciplines that they used to be. I think he also proved it was okay to have deviated from the norm. Khachiyan could be labeled a mathematician, a computer scientist, an operations researcher, an algorithmic mathematician, or perhaps all of the above, but it is really immaterial. There is no definitive definition of any of these subjects anyway.[2]
Browne, Malcolm (November 27, 1979). "An Approach to Difficult Problems". The New York Times.
Friendly, Jonathan (November 11, 1979). "Shazam! A Shortcut for Computers". The New York Times.
"A Russian's Solution In Math Question". The New York Times. March 21, 1980.
References edit
- Citations
- ^ "Leonid Khachiyan, 52; Computer Science Expert at Rutgers". Los Angeles Times. May 5, 2005.
- ^ Cite error: The named reference
Kalantariwas invoked but never defined (see the help page).