Punnen A.P.

A.P. Punnen

Information about the author A.P. Punnen will soon be added to the site.
Found 10 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...
On locating a single path-like facility in a general graph
On locating a single path-like facility in a general graph
1997
The problem of locating a path-like facility of fixed length in a tree can be solved...
Multiple bottleneck assignment problem
Multiple bottleneck assignment problem
1999
We consider the multiple bottleneck assignment problem which subsumes the well known...
A tabu search algorithm for the resource-constrained assignment problem
A tabu search algorithm for the resource-constrained assignment problem
1995
Efficient algorithms are available to solve the unconstrained assignment problem....
Minimax linear knapsack problem with grouped variables and GUB constraints
Minimax linear knapsack problem with grouped variables and GUB constraints
1993
Let be a partition of , be a partition of and and are scalars for . We consider the...
Categorized assignment scheduling: A tabu search approach
Categorized assignment scheduling: A tabu search approach
1993
The assignment problem (AP) and bottleneck assignment problem (BAP) are well studied...
K-sum linear programming
K-sum linear programming
1992
In this note the k- sum linear programming problem (KLP) is introduced, which subsumes...
k-sum optimization problems
k-sum optimization problems
1990
The authors consider a family of subsets of a finite set, each of cardinality n, as...
Minmax linear programmes with grouped variables
Minmax linear programmes with grouped variables
1989
The authors consider an optimization problem in which Max[ c j x j...
Group centre and group median of a network
Group centre and group median of a network
1989
The absolute centre and median of a network can be computed in polynomial time. The...
Papers per page: