Our group began computing the least cost solutions to tranportation-like problems arising when the army advertised it ... Heller, Tucker, Dantzig, Ford, Fulkerson, Kruskal, Tompkins and others) that you could prove combinatorial theorems by ... applied to the transportation problem, so was Dilwortha#39;s theorem on the decomposition of a partially ordered set into chains. ... and I am very pleased that my first two PhD students (Bob Singleton and Allan Gewirtz) were close to Tucker: Bob hadanbsp;...

Title | : | History of integer programming |

Author | : | Kurt Spielberg, Monique Guignard-Spielberg |

Publisher | : | - 2007 |

Continue