Browsing Working Papers by Author "Sastry, S. Trilochan"
Now showing items 1-3 of 3
-
Cutting plane based methods for integer programs
Sastry, S. Trilochan (2010-03-29)A wide variety of integer programs belong to the class of hard combinational optimization problems, and there is no known algorithm to date to solve them in polynomial time. Examples are the multi item lot sizing problems, ... -
The guru shishya relationship: some implications for educational institutions
Sastry, S. Trilochan (2010-03-25)In this paper we trace the historical basis of the Gurushishya relationship and explore its implications for modern education. Our hypothesis is that this relationship is rooted in a religious and spiritual basis and that ... -
Valid inequalities and facets for the capacitated lot-sizing problem with changeover costs
Sastry, S. Trilochan (2010-03-29)We study a scheduling problem with changeover costs and capacity constraints. The problem is NP-complete and combinatorial algorithms have not been very successful. We identify a general class of facets which subsumes as ...