AAAAAA

   
Results: 1-10 |
Results: 10
EXACT ALGORITHMS FOR THE STOCHASTIC SHORTEST-PATH PROBLEM WITH A DECREASING DEADLINE UTILITY FUNCTION
Authors: MURTHY I SARKAR S
Citation: I. Murthy et S. Sarkar, EXACT ALGORITHMS FOR THE STOCHASTIC SHORTEST-PATH PROBLEM WITH A DECREASING DEADLINE UTILITY FUNCTION, European journal of operational research, 103(1), 1997, pp. 209-229
CONSTRUCTING EFFICIENT BELIEF NETWORK STRUCTURES WITH EXPERT PROVIDEDINFORMATION
Authors: SARKAR S MURTHY I
Citation: S. Sarkar et I. Murthy, CONSTRUCTING EFFICIENT BELIEF NETWORK STRUCTURES WITH EXPERT PROVIDEDINFORMATION, IEEE transactions on knowledge and data engineering, 8(1), 1996, pp. 134-143
AN INFORMATION-THEORETIC TECHNIQUE TO DESIGN BELIEF NETWORK-BASED EXPERT-SYSTEMS
Authors: SARKAR S SRIRAM RS JOYKUTTY S MURTHY I
Citation: S. Sarkar et al., AN INFORMATION-THEORETIC TECHNIQUE TO DESIGN BELIEF NETWORK-BASED EXPERT-SYSTEMS, Decision support systems, 17(1), 1996, pp. 13-30
A RELAXATION-BASED PRUNING TECHNIQUE FOR A CLASS OF STOCHASTIC SHORTEST-PATH PROBLEMS
Authors: MURTHY I SARKAR S
Citation: I. Murthy et S. Sarkar, A RELAXATION-BASED PRUNING TECHNIQUE FOR A CLASS OF STOCHASTIC SHORTEST-PATH PROBLEMS, Transportation science, 30(3), 1996, pp. 220-236
AN INTERACTIVE DECISION-SUPPORT SYSTEM FOR THE BANK COURIER ROUTING PROBLEM
Authors: ZAPPE C VENKATARAMANAN MA MURTHY I
Citation: C. Zappe et al., AN INTERACTIVE DECISION-SUPPORT SYSTEM FOR THE BANK COURIER ROUTING PROBLEM, Mathematical and computer modelling, 21(12), 1995, pp. 1-11
CRITERIA TO EVALUATE APPROXIMATE BELIEF NETWORK REPRESENTATIONS IN EXPERT-SYSTEMS
Authors: SARKAR S MURTHY I
Citation: S. Sarkar et I. Murthy, CRITERIA TO EVALUATE APPROXIMATE BELIEF NETWORK REPRESENTATIONS IN EXPERT-SYSTEMS, Decision support systems, 15(4), 1995, pp. 323-350
AN INTERACTIVE PROCEDURE USING DOMINATION CONES FOR BICRITERION SHORTEST-PATH PROBLEMS
Authors: MURTHY I OLSON DL
Citation: I. Murthy et Dl. Olson, AN INTERACTIVE PROCEDURE USING DOMINATION CONES FOR BICRITERION SHORTEST-PATH PROBLEMS, European journal of operational research, 72(2), 1994, pp. 417-431
FILE ALLOCATION INVOLVING WORST-CASE RESPONSE-TIMES AND LINK CAPACITIES - MODEL AND SOLUTION PROCEDURE
Authors: MURTHY I GHOSH D
Citation: I. Murthy et D. Ghosh, FILE ALLOCATION INVOLVING WORST-CASE RESPONSE-TIMES AND LINK CAPACITIES - MODEL AND SOLUTION PROCEDURE, European journal of operational research, 67(3), 1993, pp. 418-427
A NESTED DUAL ASCENT PROCEDURE FOR THE DYNAMIC SINGLE FILE ALLOCATIONPROBLEM
Authors: MURTHY I SEO PK
Citation: I. Murthy et Pk. Seo, A NESTED DUAL ASCENT PROCEDURE FOR THE DYNAMIC SINGLE FILE ALLOCATIONPROBLEM, INFOR. Information systems and operational research, 31(3), 1993, pp. 186-204
A HEURISTIC-PROCEDURE FOR LEASING CHANNELS IN TELECOMMUNICATIONS NETWORKS
Authors: KOUSIK I GHOSH D MURTHY I
Citation: I. Kousik et al., A HEURISTIC-PROCEDURE FOR LEASING CHANNELS IN TELECOMMUNICATIONS NETWORKS, The Journal of the Operational Research Society, 44(7), 1993, pp. 659-672
Risultati: 1-10 |