The use of cutting planes to solve MILP was introduced by Ralph E. Gomory and Václav Chvátal.
he studied a weighted version of the set cover problem, and proved that a greedy algorithm provides good approximations to the optimal solution, generalizing previous unweighted results by David S. Johnson (J. Comp. Sys. Sci. 1974) and László Lovász (Discrete Math. 1975).
Václav Havel | Karel Václav Rais | Vaclav Vaca | Václav Klaus | Václav Hudeček | Václav Patejdl | Vaclav Klaus | Václav Kaplický | Václav Trégl | Václav Neckář | Jan Václav Voříšek | Václav Vojta | Václav Talich | Václav Špála | Václav Milík, Sr. | Václav Machek | Václav Kliment Klicpera | Václav Chvátal | Václav | Janet Chvatal |