K. P. K. Nair

20 papers Journal 19Unranked 1
YearRankTypeTitle / Venue / Authors
2010 J jnl
A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks.
Eur. J. Oper. Res.
Yash P. Aneja, Ramaswamy Chandrasekaran, Xiangyong Li, K. P. K. Nair
2009 J jnl
2-Commodity Integer Network Synthesis Problem.
Algorithmic Oper. Res.
Santosh N. Kabadi, R. Chandrasekaran, K. P. K. Nair
2009 — conf
Minimum Energy Strong Bidirectional Topology for Ad Hoc Wireless Sensor Networks.
ICC
Yash P. Aneja, Ataul Bari, Arunita Jaekel, Ramaswamy Chandrasekaran, K. P. K. Nair
2008 J jnl
Integer Exact Network Synthesis Problem.
SIAM J. Discret. Math.
Santosh N. Kabadi, J. Yan, Donglei Du, K. P. K. Nair
2008 J jnl
Integer version of the multipath flow network synthesis problem.
Discret. Appl. Math.
Santosh N. Kabadi, Ramaswamy Chandrasekaran, K. P. K. Nair, Yash P. Aneja
2008 J jnl
VLSN search algorithms for partitioning problems using matching neighbourhoods.
J. Oper. Res. Soc.
Temel Öncan, Santosh N. Kabadi, K. P. K. Nair, Abraham P. Punnen
2007 J jnl
Flows over edge-disjoint mixed multipaths and applications.
Discret. Appl. Math.
Yash P. Aneja, Ramaswamy Chandrasekaran, Santosh N. Kabadi, K. P. K. Nair
2005 J jnl
Fuzzy disk for covering fuzzy points.
Eur. J. Oper. Res.
Lushu Li, Santosh N. Kabadi, K. P. K. Nair
2005 J jnl
Multiroute flows: Cut-trees and realizability.
Discret. Optim.
Santosh N. Kabadi, Ramaswamy Chandrasekaran, K. P. K. Nair
2004 J jnl
Minimal-cost system reliability with discrete-choice sets for components.
IEEE Trans. Reliab.
Yash P. Aneja, R. Chandrasekaran, K. P. K. Nair
2002 J jnl
Fuzzy versions of the covering circle problem.
Eur. J. Oper. Res.
Lushu Li, Santosh N. Kabadi, K. P. K. Nair
1996 J jnl
An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem.
INFORMS J. Comput.
Abraham P. Punnen, K. P. K. Nair
1993 J jnl
On stochastic spanning tree problem.
Networks
S. Geetha, K. P. K. Nair
1991 J jnl
Optimal Assignment of Components to Parallel-Series and Series-Parallel Systems.
Oper. Res.
V. Rajendra Prasad, K. P. K. Nair, Yash P. Aneja
1983 J jnl
Shortest chain subject to side constraints.
Networks
Yash P. Aneja, V. Aggarwal, K. P. K. Nair
1982 J jnl
Minimal spanning tree subject to a side constraint.
Comput. Oper. Res.
V. Aggarwal, Yash P. Aneja, K. P. K. Nair
1980 J jnl
Discounted Stochastic Ratio Games.
SIAM J. Algebraic Discret. Methods
V. Aggarwal, R. Chandrasekaran, K. P. K. Nair
1980 J jnl
Maximal expected flow in a network subject to arc failures.
Networks
Yash P. Aneja, K. P. K. Nair
1966 J jnl
Letter to the Editor - On Multistage Replacement Strategies.
Oper. Res.
V. P. Marathe, K. P. K. Nair
1966 J jnl
Multistage Planned Replacement Strategies.
Oper. Res.
V. P. Marathe, K. P. K. Nair