Punnen Abraham P.

Abraham P. Punnen

Information about the author Abraham P. Punnen will soon be added to the site.
Found 23 papers in total
A simplex algorithm for piecewise-linear fractional programming problems
A simplex algorithm for piecewise-linear fractional programming problems
2007
Generalizations of the well-known simplex method for linear programming are available...
Learning multicriteria fuzzy classification method PROAFTN from data
Learning multicriteria fuzzy classification method PROAFTN from data
2007
In this paper, we present a new methodology for learning parameters of multiple...
Variations of the prize-collecting Steiner tree problem
Variations of the prize-collecting Steiner tree problem
2006
The prize-collecting Steiner tree problem is well known to be NP-hard. We consider...
Local search in combinatorial optimization
Local search in combinatorial optimization
2005
Lexicographic balanced optimization problems
Lexicographic balanced optimization problems
2004
We introduce the lexicographic balanced optimization problem (LBaOP) and show that it...
On bottleneck assignment problems under categorization
On bottleneck assignment problems under categorization
2004
In this note we consider two types of bottleneck assignment problems under...
The traveling salesman problem: New polynomial approximation algorithms and domination analysis
The traveling salesman problem: New polynomial approximation algorithms and domination analysis
2001
For the traveling salesman problem (TSP) on n nodes, we show that a tour which is...
The travelling salesman problem: New solvable cases and linkages with the development of approximation algorithms
The travelling salesman problem: New solvable cases and linkages with the development of approximation algorithms
1997
We identify new solvable cases of the travelling salesman problem (TSP) by an indirect...
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...
Optimal expansion of capacitated transshipment networks
Optimal expansion of capacitated transshipment networks
1996
In this paper, we address the problem of allocating a given budget to increase the...
On linear multiplicative programming
On linear multiplicative programming
1997
Global minimization of quasi-concave functions over a polyhedral set is often...
Minmax combinatorial optimization
Minmax combinatorial optimization
1995
Let E be a finite set, and F be a family of subsets of E . For each element e ∈...
Postoptimal Analysis, Parametric Programming and Related Topics: Degeneracy, Multicriteria Decision Making, Redundancy (2nd Edition)
Postoptimal Analysis, Parametric Programming and Related Topics: Degeneracy, Multicriteria Decision Making, Redundancy (2nd Edition)
1997
On k-sum optimization
On k-sum optimization
1996
The k- sum optimization problem (KSOP) is the combinatorial problem of finding a...
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...
Some ratio sharing models
Some ratio sharing models
1995
A linear sharing problem is defined as a mathematical programming problem with a...
Group centre and group median of a tree
Group centre and group median of a tree
1993
The authors consider the problem of identifying group centre and group median of 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...
On combined minmax-minsum optimization
On combined minmax-minsum optimization
1994
This paper presents a modification of Minoux’s algorithm for solving the...
A linear time algorithm for the maximum capacity path problem
A linear time algorithm for the maximum capacity path problem
1991
The maximum capacity path problem is to find a path joining two fixed vertices of an...
Minimum perfect bipartite matchings and spanning trees under categorization
Minimum perfect bipartite matchings and spanning trees under categorization
1992
Network optimization problems under categorization arise when the edge set is...
Traveling salesman problem under categorization
Traveling salesman problem under categorization
1992
The paper introduces two new classes of traveling salesman problems (TSP1 and TSP2)...
Papers per page: