AAAAAA

   
Results: 1-13 |
Results: 13
Dynamic order replenishment policy in internet-based supply chains
Authors: Berman, O Kim, E
Citation: O. Berman et E. Kim, Dynamic order replenishment policy in internet-based supply chains, MATH M O R, 53(3), 2001, pp. 371-390
A decision model and support system for the optimal design of health information networks
Authors: Berman, O Zahedi, F Pemble, KR
Citation: O. Berman et al., A decision model and support system for the optimal design of health information networks, IEEE SYST C, 31(2), 2001, pp. 146-158
Location of facilities on a network with groups of demand points
Authors: Berman, O Drezner, Z Wesolowsky, GO
Citation: O. Berman et al., Location of facilities on a network with groups of demand points, IIE TRANS, 33(8), 2001, pp. 637-648
Optimal control of service for facilities holding inventory
Authors: Berman, O Sapna, KP
Citation: O. Berman et Kp. Sapna, Optimal control of service for facilities holding inventory, COMPUT OPER, 28(5), 2001, pp. 429-441
Two control policies for stochastic EOQ-type models
Authors: Berman, O Perry, D
Citation: O. Berman et D. Perry, Two control policies for stochastic EOQ-type models, PROB ENG I, 15(4), 2001, pp. 445-463
Deliveries in an inventory/routing problem using stochastic dynamic programming
Authors: Berman, O Larson, RC
Citation: O. Berman et Rc. Larson, Deliveries in an inventory/routing problem using stochastic dynamic programming, TRANSP SCI, 35(2), 2001, pp. 192-213
Minmax regret median location on a network under uncertainty
Authors: Averbakh, I Berman, O
Citation: I. Averbakh et O. Berman, Minmax regret median location on a network under uncertainty, INFORMS J C, 12(2), 2000, pp. 104-110
Routing and location on a network with hazardous threats
Authors: Berman, O Drezner, Z Wesolowsky, GO
Citation: O. Berman et al., Routing and location on a network with hazardous threats, J OPER RES, 51(9), 2000, pp. 1093-1099
Parallel complexity of additive location problems
Authors: Averbakh, I Berman, O
Citation: I. Averbakh et O. Berman, Parallel complexity of additive location problems, INFORMS J C, 11(3), 1999, pp. 292-298
Optimization models for complex recovery block schemes
Authors: Berman, O Kumar, UD
Citation: O. Berman et Ud. Kumar, Optimization models for complex recovery block schemes, COMPUT OPER, 26(5), 1999, pp. 525-544
Algorithms for path medi-centers of a tree
Authors: Averbakh, I Berman, O
Citation: I. Averbakh et O. Berman, Algorithms for path medi-centers of a tree, COMPUT OPER, 26(14), 1999, pp. 1395-1409
A simple heuristic for m-machine flow-shop and its applications in routing-scheduling problems
Authors: Averbakh, I Berman, O
Citation: I. Averbakh et O. Berman, A simple heuristic for m-machine flow-shop and its applications in routing-scheduling problems, OPERAT RES, 47(1), 1999, pp. 165-170
Reliability analysis of communicating recovery blocks
Authors: Berman, O Kumar, UD
Citation: O. Berman et Ud. Kumar, Reliability analysis of communicating recovery blocks, IEEE RELIAB, 47(3), 1998, pp. 245-254
Risultati: 1-13 |