AAAAAA

   
Results: 1-10 |
Results: 10
ON CAPACITATED STOCHASTIC CHAIN PROBLEMS IN A NETWORK
Authors: GANAPATHY L NAIR KPK
Citation: L. Ganapathy et Kpk. Nair, ON CAPACITATED STOCHASTIC CHAIN PROBLEMS IN A NETWORK, Networks, 31(1), 1998, pp. 19-27
AN O(M-LOG-N) ALGORITHM FOR THE MAX PLUS SUM SPANNING TREE PROBLEM
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
POLYNOMIAL ALGORITHMS FOR A CLASS OF DISCRETE MINMAX LINEAR-PROGRAMMING PROBLEMS
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
IMPROVED COMPLEXITY BOUND FOR THE MAXIMUM CARDINALITY BOTTLENECK BIPARTITE MATCHING PROBLEM
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
A STOCHASTIC BOTTLENECK TRANSPORTATION PROBLEM
Authors: GEETHA S NAIR KPK
Citation: S. Geetha et Kpk. Nair, A STOCHASTIC BOTTLENECK TRANSPORTATION PROBLEM, The Journal of the Operational Research Society, 45(5), 1994, pp. 583-588
A FAST AND SIMPLE ALGORITHM FOR THE BOTTLENECK BICONNECTED SPANNING SUBGRAPH PROBLEM
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
A VARIATION OF THE ASSIGNMENT PROBLEM
Authors: GEETHA S NAIR KPK
Citation: S. Geetha et Kpk. Nair, A VARIATION OF THE ASSIGNMENT PROBLEM, European journal of operational research, 68(3), 1993, pp. 422-426
EFFICIENT CHAINS IN A NETWORK WITH TIME COST TRADE-OFF FUNCTION ON EACH ARC
Authors: NAIR KPK PRASAD VR ANEJA YP
Citation: Kpk. Nair et al., EFFICIENT CHAINS IN A NETWORK WITH TIME COST TRADE-OFF FUNCTION ON EACH ARC, European journal of operational research, 66(3), 1993, pp. 392-402
A GENERALIZED TIME-COST TRADE-OFF TRANSPORTATION PROBLEM
Authors: PRASAD VR NAIR KPK ANEJA YP
Citation: Vr. Prasad et al., A GENERALIZED TIME-COST TRADE-OFF TRANSPORTATION PROBLEM, The Journal of the Operational Research Society, 44(12), 1993, pp. 1243-1248
ON STOCHASTIC SPANNING TREE PROBLEM
Authors: GEETHA S NAIR KPK
Citation: S. Geetha et Kpk. Nair, ON STOCHASTIC SPANNING TREE PROBLEM, Networks, 23(8), 1993, pp. 675-679
Risultati: 1-10 |