K. P. K. Nair

From MaRDI portal
Person:231004

Available identifiers

zbMath Open nair.k-p-kMaRDI QIDQ231004

List of research outcomes





PublicationDate of PublicationType
2-commodity integer network synthesis problem2013-12-11Paper
Integer Exact Network Synthesis Problem2010-03-17Paper
A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks2010-03-01Paper
Integer version of the multipath flow network synthesis problem2009-03-04Paper
VLSN search algorithms for partitioning problems using matching neighbourhoods2008-07-29Paper
On linear multiplicative programming.2008-01-25Paper
Flows over edge-disjoint mixed multipaths and applications2007-09-19Paper
Multiroute flows: cut-trees and realizability2006-01-09Paper
Multi-terminal multipath flows: synthesis2004-11-23Paper
Fuzzy disk for covering fuzzy points2004-11-22Paper
Parametric min-cuts analysis in a network.2003-06-10Paper
Fuzzy models for single-period inventory problem2003-04-02Paper
Parametric analysis of overall min-cuts and applications in undirected networks.2003-01-21Paper
Maximizing residual flow under an arc destruction2002-07-01Paper
Fuzzy versions of the covering circle problem2002-02-20Paper
Constrained balanced optimization problems2000-01-20Paper
An \(O(m\log n)\) algorithm for the max+sum spanning tree problem1999-05-05Paper
On capacitated stochastic chain problems in a network1998-03-05Paper
An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem1996-07-24Paper
Generalized Bottleneck Problems1996-06-23Paper
Polynomial Algorithms for a Class of Discrete Minmax Linear Programming Problems1995-07-24Paper
A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem1995-06-12Paper
Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem1994-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42876631994-05-05Paper
Efficient chains in a network with time-cost trade-off function on each arc1993-10-25Paper
Location Of A Tree Shaped Facility In A Network1993-08-11Paper
A heuristic approach to optimal assignment of components to a parallel-series network1992-06-28Paper
Optimal Assignment of Components to Parallel-Series and Series-Parallel Systems1992-06-25Paper
Optimization of bicriterion quasi-concave function subject to linear constraints1990-01-01Paper
A note on the m-center problem with rectilinear distances1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37795691988-01-01Paper
Network flows with age dependent decay rates1985-01-01Paper
Classes of linear programs with integral optimal solutions1985-01-01Paper
Production Planning in Assembly Line Systems1984-01-01Paper
Ratio dynamic programs1984-01-01Paper
Multicommodity Network Flows with Probabilistic Losses1982-01-01Paper
Minimal Cost-Reliability Ratio Spanning Tree1981-01-01Paper
Maximal expected flow in a network subject to arc failures1980-01-01Paper
Bicriteria Transportation Problem1979-01-01Paper
Two problems in multicommodity networks1979-01-01Paper
The constrained shortest path problem1978-01-01Paper
Stochastic game models of brand switching1974-01-01Paper
Multistage Planned Replacement Strategies1966-01-01Paper
Multistage Replacement Strategies with Finite Duration of Transfer1965-01-01Paper
Multistage Replacement Strategies1965-01-01Paper

Research outcomes over time

This page was built for person: K. P. K. Nair