AAAAAA
Results:
1-19
|
Results: 19
Authors:
PHILLIPS JM
PUNNEN AP
KABADI SN
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
Authors:
PUNNEN AP
ANEJA YP
Citation: Ap. Punnen et Yp. Aneja, MINIMUM DISPERSION PROBLEMS, Discrete applied mathematics, 75(1), 1997, pp. 93-102
Authors:
PUNNEN AP
Citation: Ap. Punnen, ON LOCATING A SINGLE PATH-LIKE FACILITY IN A GENERAL GRAPH, RAIRO. Recherche operationnelle, 31(2), 1997, pp. 107-115
Authors:
GLOVER F
PUNNEN AP
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
Authors:
PUNNEN AP
Citation: Ap. Punnen, POSTOPTIMAL ANALYSIS, PARAMETRIC PROGRAMMING, AND RELATED TOPICS - DEGENERACY, MULTICRITERIA DECISION-MAKING, REDUNDANCY - GAL,T, Interfaces, 27(4), 1997, pp. 84-86
Authors:
PUNNEN AP
NAIR KPK
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
Authors:
AHUJA RK
BATRA JL
GUPTA SK
PUNNEN AP
Citation: Rk. Ahuja et al., OPTIMAL EXPANSION OF CAPACITATED TRANSSHIPMENT NETWORKS, European journal of operational research, 89(1), 1996, pp. 176-184
Authors:
PUNNEN AP
ANEJA YP
Citation: Ap. Punnen et Yp. Aneja, ON K-SUM OPTIMIZATION, Operations research letters, 18(5), 1996, pp. 233-236
Authors:
PUNNEN AP
Citation: Ap. Punnen, A FAST ALGORITHM FOR A CLASS OF BOTTLENECK PROBLEMS, Computing, 56(4), 1996, pp. 397-401
Authors:
AVERBAKH I
BERMAN O
PUNNEN AP
Citation: I. Averbakh et al., CONSTRAINED MATROIDAL BOTTLENECK PROBLEMS, Discrete applied mathematics, 63(3), 1995, pp. 201-214
Authors:
PUNNEN AP
ANEJA YP
Citation: Ap. Punnen et Yp. Aneja, MINMAX COMBINATORIAL OPTIMIZATION, European journal of operational research, 81(3), 1995, pp. 634-643
Authors:
PUNNEN AP
NAIR KPK
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
Authors:
PUNNEN AP
ANEJA YP
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
Authors:
PUNNEN AP
Citation: Ap. Punnen, INTERIOR-POINT APPROACH TO LINEAR, QUADRATIC, AND CONVEX-PROGRAMMING - DENHERTOG,D, Interfaces, 25(4), 1995, pp. 132-133
Authors:
PUNNEN AP
NAIR KPK
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
Authors:
PUNNEN AP
Citation: Ap. Punnen, ON COMBINED MINMAX-MINSUM OPTIMIZATION, Computers & operations research, 21(6), 1994, pp. 707-716
Authors:
PUNNEN AP
NAIR KPK
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
Authors:
PUNNEN AP
Citation: Ap. Punnen, TRAVELING SALESMAN PROBLEM UNDER CATEGORIZATION (VOL 12, PG 89-95, 1992), Operations research letters, 14(2), 1993, pp. 121-121
Authors:
PUNNEN AP
ANEJA YP
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
Risultati:
1-19
|