Nair K.P.K.

K.P.K. Nair

Information about the author K.P.K. Nair will soon be added to the site.
Found 18 papers in total
VLSN search algorithms for partitioning problems using matching neighbourhoods
VLSN search algorithms for partitioning problems using matching neighbourhoods
2008
In this paper, we propose a general paradigm to design very large-scale neighbourhood...
Fuzzy disk for covering fuzzy points
Fuzzy disk for covering fuzzy points
2005
In this paper, we consider an important fuzzy version of the well known smallest...
Maximizing residual flow under an arc destruction
Maximizing residual flow under an arc destruction
2001
In this paper, we consider two problems related to single-commodity flows on a...
On capacitated stochastic chain problems in a network
On capacitated stochastic chain problems in a network
1998
This paper considers two basic problems relating to capacitated chains in a stochastic...
Fuzzy versions of the covering circle problem
Fuzzy versions of the covering circle problem
2002
In this paper we consider two fuzzy versions of the well-known problem of determining...
An improved algorithm for the constrained bottleneck spanning tree problem
An improved algorithm for the constrained bottleneck spanning tree problem
1996
We propose an algorithm to solve the bottleneck spanning tree problem with an...
An O(m log n) algorithm for the max + sum spanning tree problem
An O(m log n) algorithm for the max + sum spanning tree problem
1996
In a graph in which each edge has two weights, the max + sum spanning tree...
On linear multiplicative programming
On linear multiplicative programming
1997
Global minimization of quasi-concave functions over a polyhedral set is often...
An improved algorithm for the constrained bottleneck spanning tree problem
An improved algorithm for the constrained bottleneck spanning tree problem
1996
The authors propose an algorithm to solve the bottleneck spanning tree problem with an...
A variation of the assignment problem
A variation of the assignment problem
1993
In this paper, a meaningful variant of the cost minimizing assignment problem with the...
Efficient chains in a network with time-cost trade-off function on each arc
Efficient chains in a network with time-cost trade-off function on each arc
1993
In this paper, the authors consider a network in which each arc is associated with a...
Polynomial algorithms for a class of discrete minmax linear programming problems
Polynomial algorithms for a class of discrete minmax linear programming problems
1995
This paper considers the problem of obtaining integer solutions to a minmax linear...
A stochastic bottleneck transportation problem
A stochastic bottleneck transportation problem
1994
In this paper, a stochastic bottleneck transportation problem, which aims at...
A generalized time-cost trade-off transportation problem
A generalized time-cost trade-off transportation problem
1993
In the classical transportation probem if the unit costs and transportation durations...
Markovian assignment decision process
Markovian assignment decision process
1992
A finite-state, discrete-time Markovian decision process, in which, each action in...
Optimal assignment of components to parallel-series and series-parallel systems
Optimal assignment of components to parallel-series and series-parallel systems
1991
This paper deals with the problem of assigning components to parallel-series (PS) and...
Location of a tree shaped facility in a network
Location of a tree shaped facility in a network
1992
The authors consider the problem of locating a tree shaped facility in an undirected...
Optimization of bicriterion quasi-concave functions subject to linear constraints
Optimization of bicriterion quasi-concave functions subject to linear constraints
1990
In this paper the authors provide algorithms for maximization and minimization of...
Papers per page: