Abraham P. Punnen

Journal Publications

  1. J. LaRusic, A.P. Punnen, and E. Aubanel, Experimental analysis of algorithms for the bottleneck traveling salesman problem and its variations, Journal of Heuristics, accepted.
  2. R. Zhang and A.P. Punnen, Quadratic bottleneck knapsack problems, Journal of Heuristics, accepted.
  3. Q. Han and A.P. Punnen, On the approximability of vertex cover and related problems, Discrete Applied Mathematics 160 (2012) 197-203.
  4. D. K. Benvenuti and A.P. Punnen, Three-value TSP and linkages with the three value linear spanning 2-forests, Discrete Applied Mathematics 160 (2012) 38-52.
  5. S. N. Kabadi and A. P. Punnen, An O(n4) algorithm for the QAP linearization problem, Mathematics of Operations Research 36 (2011) 754-761.
  6. A.P. Punnen and R. Zhang, Quadratic bottleneck Problems, Naval Research Logistics 58 (2011) 153-164.
  7. R. Zhang, S.N. Kabadi and A.P. Punnen, Minimum spanning tree problem with conflict constraints and variations, Discrete Optimization, 8 (2011) 191-205.
  8. L. Turner, A. P. Punnen, Y. P, Aneja, and H. W. Hamacher, On generalized balanced optimization problems, Mathematical Methods of Operations Research 73 (2011) 19--27.
  9. J. LaRusic and A.P. Punnen, The balanced traveling salesman problem, Computers and Operations Research 38 (2011) 868-875.
  10. S. N. Kabadi and A. P. Punnen, Trioid: A generalization of matroid and the associated polytope, Algorithmic operations research 6 (2011) 29-39.
  11. D. K. Benvenuti and A.P. Punnen, SC-Hamiltonian graphs and digraphs: New necessary conditions and impacts, Discrete Mathematics 310 (2010) 2841-2846
  12. D. K. Benvenuti and A. P. Punnen, SC-Hamiltonicity and its linkages with strong Hamiltonicity of a graph, SIAM Journal on Discrete Mathematics 23 (2010) 2035-2041.
  13. T. Oncan and A.P. Punnen,The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm, Computers and Operations Research 37 (2010) 1762-1773.
  14. Q. Han, A.P. Punnen, and Y. Ye, An edge-reduction algorithm for the vertex cover problem Operations Research Letters 37 (2009) 181-186.
  15. S. Mitrovic-Minic and A.P. Punnen, Local Search Intensified: Very Large-Scale Variable Neighborhood Search for the Multi-Resource Generalized Assignment Problem, Discrete Optimization, 6 (2009) 370-377
  16. R. Zhang and A.P. Punnen, Bottleneck Flows in Networks, Information processing letters 109 (2009) 334-338.
  17. R. Ramakrishnan, P. Sharma, and A. P. Punnen, An efficient heuristic algorithm for the bottleneck traveling salesman problem, Opsearch 46 (2009) 275-288.
  18. P. Pandey and A.P. Punnen, A simplex algorithm for network flow problems with piecewise linear fractional objective function, Opsearch 46 (2009) 359-389.
  19. Santosh N. Kabadi, Abraham P. Punnen: A strongly polynomial simplex method for the linear fractional assignment problem, Operations Research Letters, 36 (2008) 402-407.
  20. T. Oncan, S.N. Kabadi, K.P.K. Nair, A.P. Punnen, VLSN search algorithms for partitioning problems, Journal of the Operational Research Society (UK) 59 (2008)388-398.
  21. S. Mitrovic-Minic and A.P. Punnen, Very large-scale variable neighborhood search for the generalized assignment problem Journal of Interdisciplinary Mathematics 11 (2008) 653-670.
  22. P. Pandey and A.P. Punnen, Simplex method for piecewise-linear fractional programming problem, European Journal of Operational Research 178 (2007) 343-358.
  23. N. Belacel, H. Raval, and A.P. Punnen, Learning multicriteria classification method PROAFTN from data, Computers and Operations Research 34 (2007) 1885-1898.
  24. S.N. Kabadi and A.P. Punnen, On cost matrices with two and three distinct values of Hamiltonian paths and cycles, SIAM Journal of Discrete Mathematics 20 (2006) 977-998.
  25. O. Chapovska and A.P. Punnen, Variations of the prize collecting traveling salesman problem, Networks 47 (2006) 199-205.
  26. A.P. Punnen and O. Chapovska, The Bottleneck k-MST, Information Processing Letters 95 (2005) 512-517.
  27. AP Punnen "Minmax strongly connected subgraph problem with node weights", Journal of applied mathematics and decision sciences 2005
  28. JB Orlin, AP Punnen, and A Schulz, "Approximate local search in combinatorial optimization", SIAM Journal of Computing 33 (2004) 1201-1214.
  29. AP Punnen and YP Aneja, Lexicographic balanced optimization problems, Operations Research Letters 32 (2004) 27-30.
  30. AP Punnen, "On bottleneck assignment problem under categorization", Computers and Operations Research 31 (2004) 151-154.
  31. SN Kabadi and AP Punnen, "Weighted graphs with Hamiltonian cycles of same length", Discrete Mathematics 271 (2003)129-139.
  32. AP Punnen, F Margot, and SN Kabadi, "TSP heuristics: domination analysis and complexity", Algorithmica 35 (2003) 111-127
  33. AP Punnen and S N Kabadi, "Domination Analysis of some heuristics for the asymmetric traveling salesman problem", Discrete Applied Mathematics 119 (2002) 117-128.
  34. P Vellaisamy and AP Punnen "Improved estimators for the selected location parameters", Statistical Papers 43 (2002) 291-299
  35. Ahuja R K, Ergun O, JB Orlin , AP Punnen, "A survey of very large scale neighborhood search techniques", Discrete Applied Mathematics 123 (2002) 75 - 102.
  36. AP Punnen and YP Aneja, "Randomized local search algorithms", International Journal of Management and systems ,(accepted) Abstract
  37. AP Punnen, "Combinatorial optimization with multiplicative objective function" International Journal of Operations and Quantitative Management 7 (2001) 205 - 209
  38. AP Punnen, "The traveling salesman problem: New approximation algorithms and domination analysis, Journal of Information and Optimization, 22 (2001) 191-206
  39. P Vellaisamy and AP Punnen "On the nature of binomial distribution", Journal of Applied Probability 38 (2001) 36-44.
  40. AP Punnen and YP Aneja, "An improved lower bound for the multiple bottleneck assignment problem" European Journal of Operations Research, 112 (1999) 167-173
  41. AP Punnen and KPK Nair, "Constrained balanced optimization problems" Computers and Mathematics with applications 37 (1999) 157-163, Abstract
  42. JM Philips, AP Punnen and SN Kabadi, A linear time algorithm for the bottleneck travelling salesman problem on a Halin graph,Information Processing Letters., 30 (1998)105-108 >
  43. AP Punnen and KPK Nair, "Linear Multiplicative Programming" Opsearch, 1997
  44. F Glover and AP Punnen, "The travelling salesman problem: New solvable cases and linkages with the development of approximation algorithms" Journal of the Operational Research Society, 48 (1997) 502-510
  45. AP Punnen, "On locating a single path-like facility in a general graph", RAIRO-Operations Research, 31 (1997) 107-115 Abstract
  46. AP Punnen and YP Aneja, "Minimum Dispersion Problems" Discrete Applied Mathematics, 75 (1997) 93-102
  47. AP Punnen and YP Aneja, "On k-sum optimization problems", Operations Research Letters, 18 (1996) 233-236 >Abstract
  48. AP Punnen, "A fast algorithm for a class of bottleneck problems" Computing, 56 (1996) 397-401 (short communication) Abstract
  49. RK Ahuja, JL Batra, SK Gupta and AP Punnen, "Optimal expansion of capacitated transshipment networks" European Journal of Operations Research, 89 (1996) 176-184
  50. AP Punnen and KPK Nair, "An O(nlogn) algorithm for the max+sum spanning tree problem", European Journal of Operations Research, 89 (1996) 423-426 Abstract
  51. AP Punnen and KPK Nair, "An improved algorithm for constrained bottleneck spanning tree problem" INFORMS Journal of Computing, 8 (1996) 41-44 Abstract
  52. AP Punnen and SK Bhatt, "Some ratio sharing models", Asia Pacific Journal of Operational Research, 12 (1995) 187-198 Abstract
  53. AP Punnen, KPK Nair and YP Aneja, "Generalized bottleneck problems", Optimization, 35 (1995) 159-169 Abstract
  54. I Averbach, O Berman and AP Punnen, "Constrained matroidal bottleneck problems", Discrete Applied Mathematics, 63 (1995) 201-214
  55. AP Punnen and KPK Nair, "Polynomial algorithms for a class of discrete minmax linear programming problems", Journal of Operational Society, 46 (1995) 499-506 Abstract
  56. AP Punnen and YP Aneja, "Minmax combinatorial optimization", European Journal of Operational Research, 81 (1995) 634-643 Abstract
  57. AP Punnen and YP Aneja, "A tabu search algorithm for resource constrained assignment problem", Journal of Operational Research Society, 46 (1995) 214-220 Abstract
  58. AP Punnen and KPK Nair, "Improved complexity bound for the bottleneck bipartite matching problem", Discrete Applied Mathematics, 55 (1994) 91-93 Abstract
  59. AP Punnen and KPK Nair, "A fast and simple algorithm for the bottleneck bi-connected spanning subgraph problem" Information Processing Letters, 50 (1994) 283-286 Abstract
  60. AP Punnen, "On combined minmax-minsum optimization", Computers and Operations Research, 21 (1994) 707-716
  61. AP Punnen and YP Aneja, "Categorized assignment scheduling: A tabu search approach", Journal of OPerational Reserach Society, 44 (1993) 673-679 Abstract
  62. SK Gupta and AP Punnen, "Minmax linear knapsack problem with grouped variables and GUB constraints", Optimization, 28 (1993) 85-94 Abstract
  63. SK Gupta and AP Punnen, "Group centre and group median of a tree", European Journal of Operational Research, 65 (1993) 400-406
  64. MB Richey and AP Punnen, "Minimum weight perfect bipartite matching and spanning trees under categorization", Discrete Applied Mathematics, 39 (1992) 147-153 Abstract
  65. AP Punnen, "K-sum linear programming", Journal of Operational Research Society, 43 (1992) 89-95 Abstract
  66. AP Punnen, "Travelling salesman problem under categorization", Operations Research Letters, 12 (1992) 89-95 Abstract
  67. AP Punnen, "A linear time algorithm for the maximum capacity path problem", European Journal of Operational Research, 53 (1991) 402-404 Abstract
  68. SK Gupta and AP Punnen, "K-sum optimization problems", Operations Research Letters, 9 (1990) 121-126
  69. SK Gupta and AP Punnen, "Minmax linear programs with grouped variables", Opsearch, 26 (1989) 177-186 Abstract
  70. SK Gupta and AP Punnen, "Group centre and group median of a network", European Journal of Operational Research, 38 (1989) 94-98
  71. SK Gupta and AP Punnen, "Minimum deviation problems", Operations Research Letters, 7 (1988) 201-204 Abstract