Citation: Jm. Phillips et al., A LINEAR-TIME ALGORITHM FOR THE BOTTLENECK TRAVELING SALESMAN PROBLEMON A HALIN GRAPH, Information processing letters, 67(2), 1998, pp. 105-110
Citation: F. Glover et Ap. Punnen, THE TRAVELING SALESMAN PROBLEM - NEW SOLVABLE CASES AND LINKAGES WITHTHE DEVELOPMENT OF APPROXIMATION ALGORITHMS, The Journal of the Operational Research Society, 48(5), 1997, pp. 502-510
Citation: Ap. Punnen et Kpk. Nair, AN O(M-LOG-N) ALGORITHM FOR THE MAX PLUS SUM SPANNING TREE PROBLEM, European journal of operational research, 89(2), 1996, pp. 423-426
Citation: Rk. Ahuja et al., OPTIMAL EXPANSION OF CAPACITATED TRANSSHIPMENT NETWORKS, European journal of operational research, 89(1), 1996, pp. 176-184
Citation: Ap. Punnen et Kpk. Nair, POLYNOMIAL ALGORITHMS FOR A CLASS OF DISCRETE MINMAX LINEAR-PROGRAMMING PROBLEMS, The Journal of the Operational Research Society, 46(4), 1995, pp. 499-506
Citation: Ap. Punnen et Yp. Aneja, A TABU SEARCH ALGORITHM FOR THE RESOURCE-CONSTRAINED ASSIGNMENT PROBLEM, The Journal of the Operational Research Society, 46(2), 1995, pp. 214-220
Citation: Ap. Punnen et Kpk. Nair, IMPROVED COMPLEXITY BOUND FOR THE MAXIMUM CARDINALITY BOTTLENECK BIPARTITE MATCHING PROBLEM, Discrete applied mathematics, 55(1), 1994, pp. 91-93
Citation: Ap. Punnen et Kpk. Nair, A FAST AND SIMPLE ALGORITHM FOR THE BOTTLENECK BICONNECTED SPANNING SUBGRAPH PROBLEM, Information processing letters, 50(5), 1994, pp. 283-286
Citation: Ap. Punnen et Yp. Aneja, CATEGORIZED ASSIGNMENT SCHEDULING - A TABU SEARCH APPROACH, The Journal of the Operational Research Society, 44(7), 1993, pp. 673-679