|
|
|
|
|
Rakesh Kawatra
We present an integer programming formulation of the min-sum arborescence with node outage costs problem. The solution to the problem consists of selecting links to connect a set of terminal nodes to a root node with minimal expected annual cost, where t...
ver más
|
|
|
|
|
|
|
|
|
|
|
J.T. Carlson, T.C. Eisele and S. Komar Kawatra: Graduate student, assistant professor and professor, respectively, Department of Chemical Engineering,N. Chow, A. Nacu, D. Warkentin, H. Teh and I. Aksenov: Kemetco Research Inc., Richmond, BC, Canada J.W. F
Pág. 64
|
|
|
|
|
|
|
|
|
|
|
B. Anameric and S.K. Kawatra
Pág. 24 - 32
|
|
|
|
|
|
|
|
|
|
|
Rakesh Kawatra
In this paper we present a new heuristic procedure to solve the degree constrained minimal spanning tree problem. This procedure uses Lagrangian relaxation of the integer programming formulation of the problem to get a lower bound for the optimal objecti...
ver más
|
|
|
|
|
|
|
|
|
|
|
K. A. Lewandowski and S. Komar Kawatra
Pág. 8 - 16
|
|
|
|
|
|
|
|
|
|
|
S.L. de Moraes and S.K. Kawatra
Pág. 148 - 153
|
|
|
|
|
|
|
|
|
|
|
Basak ANAMERIC and S. Komar KAWATRA
Pág. 53
|
|
|
|
|
|
|
|
|
|
|
Kawatra, S.K.; Ripke, S.J.
Pág. 647 - 659
|
|
|
|
|
|
|
|
|
|
|
Kawatra, S.K.; Bakshi, A.K.; Eisele, T.C.
Pág. 418 - 423
|
|
|
|
|
|