Punnen Abraham P

Abraham P Punnen

Information about the author Abraham P Punnen will soon be added to the site.
Found 9 papers in total
The minimum cost perfect matching problem with conflict pair constraints
2013
In this paper we address the minimum cost perfect matching problem with conflict pair...
Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem
2012
In this note, we show that if the maximum clique problem can be solved by a polynomial...
Quadratic bottleneck problems
2011
We study the quadratic bottleneck problem (QBP) which generalizes several well-studied...
An O(n
4) Algorithm for the QAP Linearization Problem
2011
An instance of the quadratic assignment problem (QAP) with cost matrix Q is said to be...
The balanced traveling salesmanproblem
2011
In this paper we introduce the balanced traveling salesman problem (BTSP), which can...
An edge-reduction algorithm for the vertex cover problem
2009
An approximation algorithm for the vertex cover problem is proposed with performance...
A strongly polynomial simplex method for the linear fractional assignment problem
2008
In this paper we show that the complexity of the simplex method for the linear...
An efficient heuristic algorithm for the bottleneck traveling salesman problem
2009
This paper describes a new heuristic algorithm for the bottleneck traveling salesman...
A simplex algorithm for network flow problems with piecewise-linear fractional objective function
2009
The simplex algorithm for network flow problems has been proposed for linear,...
Papers per page: