Pramod Kumar Singh

Learn More
The 0-1 knapsack problem is a well-studied combinatorial optimization problem and much research has been performed on many variants of the problem [1,28]. There are single and multiobjective versions of the problem involving one and m-dimensional knapsacks [9,15]. Even the single objective case has been proven to be NP-hard. Much research for the single(More)
The problem of computing spanning trees along with specific constraints is mostly NP-hard. Many approximation and stochastic algorithms which yield a single solution, have been proposed. In this paper, we formulate the generic multi-objective spanning tree (MOST) problem and consider edge-cost and diameter as the two objectives. Since the problem is hard,(More)
In this paper, we consider a biobjective minimum spanning tree problem (MOST) and minimize two objectives - tree cost and diameter - in terms of Pareto-optimality. We assess the quality of obtained MOEA solutions in comparison to well-known diameter-constrained minimum spanning tree (dc-MST) algorithms and further improve MOEA solutions using(More)
Salinity stress is one of the major abiotic stresses affecting plant growth and productivity globally. In order to improve the yields of plants growing under salt stress bear remarkable importance to supply sustainable agriculture. Acclimation of plants to salinized condition depends upon activation of cascade of molecular network involved in stress(More)