 | 2009 |
|---|
| 31 |       | James B. Orlin,
Abraham P. Punnen,
Andreas S. Schulz:
Integer Programming: Optimization and Evaluation Are Equivalent.
WADS 2009: 519-529 |
| 30 | | Abraham P. Punnen,
Ruonan Zhang:
Bottleneck flows in unit capacity networks.
Inf. Process. Lett. 109(6): 334-338 (2009) |
| 29 | | Qiaoming Han,
Abraham P. Punnen,
Yinyu Ye:
An edge-reduction algorithm for the vertex cover problem.
Oper. Res. Lett. 37(3): 181-186 (2009) |
| 2008 |
|---|
| 28 | | Santosh N. Kabadi,
Abraham P. Punnen:
A strongly polynomial simplex method for the linear fractional assignment problem.
Oper. Res. Lett. 36(4): 402-407 (2008) |
| 2007 |
|---|
| 27 | | Qiaoming Han,
Abraham P. Punnen:
On the approximability of the vertex cover and related problems
CoRR abs/0712.3333: (2007) |
| 26 | | Qiaoming Han,
Abraham P. Punnen,
Yinyu Ye:
A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs
CoRR abs/0712.3335: (2007) |
| 25 | | Abraham P. Punnen,
Ruonan Zhang:
Bottleneck flows in networks
CoRR abs/0712.3858: (2007) |
| 24 | | Nabil Belacel,
Hiral Bhasker Raval,
Abraham P. Punnen:
Learning multicriteria fuzzy classification method PROAFTN from data.
Computers & OR 34(7): 1885-1898 (2007) |
| 23 | | Pooja Pandey,
Abraham P. Punnen:
A simplex algorithm for piecewise-linear fractional programming problems.
European Journal of Operational Research 178(2): 343-358 (2007) |
| 2006 |
|---|
| 22 | | Olena Chapovska,
Abraham P. Punnen:
Variations of the prize-collecting Steiner tree problem.
Networks 47(4): 199-205 (2006) |
| 21 | | Santosh N. Kabadi,
Abraham P. Punnen:
On cost matrices with two and three distinct values of Hamiltonian paths and cycles.
SIAM J. Discrete Math. 20(4): 977-998 (2006) |
| 2005 |
|---|
| 20 | | Abraham P. Punnen,
Olena Chapovska:
The bottleneck k-MST.
Inf. Process. Lett. 95(5): 512-517 (2005) |
| 19 | | Abraham P. Punnen:
Minmax strongly connected subgraphs with node penalties.
JAMDS 9(2): 107-111 (2005) |
| 18 | | Abraham P. Punnen,
Prabha Sharma,
Chin Diew Lai,
Mahyar A. Amouzegar:
Preface.
JAMDS 9(2): 59-60 (2005) |
| 2004 |
|---|
| 17 | | James B. Orlin,
Abraham P. Punnen,
Andreas S. Schulz:
Approximate local search in combinatorial optimization.
SODA 2004: 587-596 |
| 16 | | Abraham P. Punnen:
On bottleneck assignment problems under categorization.
Computers & OR 31(1): 151-154 (2004) |
| 15 | | Abraham P. Punnen,
Yash P. Aneja:
Lexicographic balanced optimization problems.
Oper. Res. Lett. 32(1): 27-30 (2004) |
| 14 | | James B. Orlin,
Abraham P. Punnen,
Andreas S. Schulz:
Approximate Local Search in Combinatorial Optimization.
SIAM J. Comput. 33(5): 1201-1214 (2004) |
| 2003 |
|---|
| 13 | | Abraham P. Punnen,
François Margot,
Santosh N. Kabadi:
TSP Heuristics: Domination Analysis and Complexity.
Algorithmica 35(2): 111-127 (2003) |
| 12 | | Santosh N. Kabadi,
Abraham P. Punnen:
Weighted graphs with all Hamiltonian cycles of the same length.
Discrete Mathematics 271(1-3): 129-139 (2003) |
| 2002 |
|---|
| 11 |  | Abraham P. Punnen,
Santosh N. Kabadi:
Domination analysis of some heuristics for the traveling salesman problem.
Discrete Applied Mathematics 119(1-2): 117-128 (2002) |
| 10 | | Ravindra K. Ahuja,
Özlem Ergun,
James B. Orlin,
Abraham P. Punnen:
A survey of very large-scale neighborhood search techniques.
Discrete Applied Mathematics 123(1-3): 75-102 (2002) |
| 1998 |
|---|
| 9 | | Jeffrey Mark Phillips,
Abraham P. Punnen,
Santosh N. Kabadi:
A Linear Time Algorithm for the Bottleneck Traveling Salesman Problem on a Halin Graph.
Inf. Process. Lett. 67(2): 105-110 (1998) |
| 1997 |
|---|
| 8 | | Abraham P. Punnen,
Yash P. Aneja:
Minimum Dispersion Problems.
Discrete Applied Mathematics 75(1): 93-102 (1997) |
| 1996 |
|---|
| 7 | | Abraham P. Punnen:
A Fast Algorithm for a Class of Bottleneck Problems.
Computing 56(4): 397-401 (1996) |
| 6 | | Abraham P. Punnen,
K. P. K. Nair:
An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem.
INFORMS Journal on Computing 8(1): 41-44 (1996) |
| 1995 |
|---|
| 5 | | Igor Averbakh,
Oded Berman,
Abraham P. Punnen:
Constrained Matroidal Bottleneck Problems.
Discrete Applied Mathematics 63(3): 201-214 (1995) |
| 1994 |
|---|
| 4 | | Abraham P. Punnen:
On combined minmax-minsum optimization.
Computers & OR 21(6): 707-716 (1994) |
| 3 | | Abraham P. Punnen,
Kunhiraman Nair:
Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem.
Discrete Applied Mathematics 55(1): 91-93 (1994) |
| 2 | | Abraham P. Punnen,
Kunhiraman Nair:
A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem.
Inf. Process. Lett. 50(5): 283-286 (1994) |
| 1992 |
|---|
| 1 | | Michael B. Richey,
Abraham P. Punnen:
Minimum Perfect Bipartite Matchings and Spanning Trees under Categorization.
Discrete Applied Mathematics 39(2): 147-153 (1992) |
