| Year |
Citation |
Score |
| 2021 |
Nourinejad M, Berman O, Larson RC. Placing sensors in sewer networks: A system to pinpoint new cases of coronavirus. Plos One. 16: e0248893. PMID 33831024 DOI: 10.1371/journal.pone.0248893 |
0.56 |
|
| 2020 |
Larson RC, Berman O, Nourinejad M. Sampling manholes to home in on SARS-CoV-2 infections. Plos One. 15: e0240007. PMID 33017438 DOI: 10.1371/journal.pone.0240007 |
0.514 |
|
| 2020 |
Mehrizi HA, Baron O, Berman O, Chen D. Adoption of Electric Vehicles in Car Sharing Market Production and Operations Management. DOI: 10.2139/Ssrn.3191793 |
0.315 |
|
| 2020 |
Aboolian R, Berman O, Krass D. Optimizing facility location and design European Journal of Operational Research. DOI: 10.1016/J.Ejor.2020.06.044 |
0.385 |
|
| 2019 |
Berman O, Drezner Z, Krass D. The multiple gradual cover location problem Journal of the Operational Research Society. 70: 931-940. DOI: 10.1080/01605682.2018.1471376 |
0.386 |
|
| 2019 |
Wang J, Abouee-Mehrizi H, Baron O, Berman O. Tandem queues with impatient customers Performance Evaluation. 135: 102011. DOI: 10.1016/J.Peva.2019.102011 |
0.747 |
|
| 2019 |
Baron O, Berman O, Fazel-Zarandi MM, Roshanaei V. Almost Robust Discrete Optimization European Journal of Operational Research. 276: 451-465. DOI: 10.1016/J.Ejor.2019.01.043 |
0.416 |
|
| 2018 |
Averbakh I, Berman O, Leal M. Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights Discrete Applied Mathematics. 239: 193-199. DOI: 10.1016/J.Dam.2017.12.036 |
0.395 |
|
| 2018 |
Baron O, Berman O, Deutsch Y. On the optimality of the sequential approach for network design problems of service operations Naval Research Logistics. 65: 363-377. DOI: 10.1002/Nav.21812 |
0.489 |
|
| 2017 |
Baron O, Berman O, Krass D, Wang J. Strategic Idleness and Dynamic Scheduling in an Open-Shop Service Network: Case Study and Analysis Manufacturing & Service Operations Management. 19: 52-71. DOI: 10.1287/Msom.2016.0591 |
0.743 |
|
| 2017 |
Berman O, Hajizadeh I, Krass D, Rahimi-Vahed A. Reconfiguring a set of coverage-providing facilities under travel time uncertainty Socio-Economic Planning Sciences. 62: 1-12. DOI: 10.1016/J.Seps.2017.05.002 |
0.525 |
|
| 2017 |
Zare AG, Abouee-Mehrizi H, Berman O. Exact analysis of the (R,Q) inventory policy in a two-echelon production–inventory system Operations Research Letters. 45: 308-314. DOI: 10.1016/J.Orl.2017.04.011 |
0.314 |
|
| 2017 |
Berman O, Sanajian N, Wang J. Location choice and risk attitude of a decision maker Omega-International Journal of Management Science. 66: 170-181. DOI: 10.1016/J.Omega.2016.03.002 |
0.452 |
|
| 2016 |
Aboolian R, Berman O, Verter V. Maximal Accessibility Network Design in the Public Sector Transportation Science. 50: 336-347. DOI: 10.1287/Trsc.2015.0595 |
0.53 |
|
| 2016 |
Berman O, Krass D, Menezes MBC. Directed assignment vs. customer choice in location inventory models International Journal of Production Economics. 179: 179-191. DOI: 10.1016/J.Ijpe.2016.06.002 |
0.445 |
|
| 2016 |
Berman O, Kalcsics J, Krass D. On covering location problems on networks with edge demand Computers & Operations Research. 74: 214-227. DOI: 10.1016/J.Cor.2015.04.005 |
0.516 |
|
| 2015 |
Abouee-Mehrizi H, Berman O, Sharma S. Optimal Joint Replenishment and Transshipment Policies in a Multi-Period Inventory System with Lost Sales Operations Research. 63: 342-350. DOI: 10.2139/Ssrn.2576067 |
0.353 |
|
| 2015 |
Averbakh I, Berman O, Kalcsics J, Krass D. Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand Operations Research. 63: 394-411. DOI: 10.1287/Opre.2015.1354 |
0.46 |
|
| 2015 |
Pang Z, Berman O, Hu M. Up Then Down: Bid-Price Trends in Revenue Management Production and Operations Management. 24: 1135-1147. DOI: 10.1111/Poms.12324 |
0.364 |
|
| 2014 |
Abouee-Mehrizi H, Berman O, Baharnemati MR. Designing production-inventory-transportation systems with capacitated cross-dock Transportation Science. 48: 121-135. DOI: 10.1287/Trsc.1120.0454 |
0.446 |
|
| 2014 |
Abedi VS, Berman O, Krass D. Supporting New Product or Service Introductions: Location, Marketing, and Word of Mouth Operations Research. 62: 994-1013. DOI: 10.1287/Opre.2014.1305 |
0.375 |
|
| 2014 |
Baron O, Berman O, Krass D, Wang J. Using Strategic Idleness to Improve Customer Service Experience in Service Networks Operations Research. 62: 123-140. DOI: 10.1287/Opre.2013.1236 |
0.756 |
|
| 2014 |
Abouee-Mehrizi H, Baron O, Berman O. Exact Analysis of Capacitated Two-Echelon Inventory Systems with Priorities Manufacturing & Service Operations Management. 16: 561-577. DOI: 10.1287/Msom.2014.0494 |
0.333 |
|
| 2014 |
Bigotte JF, Antunes AP, Krass D, Berman O. The Relationship between Population Dynamics and Urban Hierarchy International Regional Science Review. 37: 149-171. DOI: 10.1177/0160017614524226 |
0.337 |
|
| 2014 |
Averbakh I, Berman O, Krass D, Kalcsics J, Nickel S. Cooperative covering problems on networks Networks. 63: 334-349. DOI: 10.1002/Net.21549 |
0.479 |
|
| 2014 |
Araghi M, Berman O, Averbakh I. Minisum multipurpose trip location problem on trees Networks. 63: 154-159. DOI: 10.1002/Net.21531 |
0.488 |
|
| 2013 |
Fazel-Zarandi MM, Berman O, Beck JC. Solving a stochastic facility location/fleet management problem with logic-based Benders' decomposition Iie Transactions (Institute of Industrial Engineers). 45: 896-911. DOI: 10.1080/0740817X.2012.705452 |
0.471 |
|
| 2013 |
Berman O, Hajizadeh I, Krass D. The maximum covering problem with travel time uncertainty Iie Transactions. 45: 81-96. DOI: 10.1080/0740817X.2012.689121 |
0.487 |
|
| 2013 |
Berman O, Drezner Z, Krass D. Continuous Covering and Cooperative Covering Problems with a General Decay Function on Networks Journal of the Operational Research Society. 64: 1644-1653. DOI: 10.1057/Jors.2012.141 |
0.471 |
|
| 2013 |
Berman O, Krass D, Menezes MBC. Location and reliability problems on a line: Impact of objectives and correlated failures on optimal location patterns Omega-International Journal of Management Science. 41: 766-779. DOI: 10.1016/J.Omega.2012.09.002 |
0.456 |
|
| 2012 |
Aboolian R, Berman O, Krass D. Profit Maximizing Distributed Service System Design with Congestion and Elastic Demand Transportation Science. 46: 247-261. DOI: 10.1287/Trsc.1110.0392 |
0.478 |
|
| 2012 |
Berman O, Gavious A, Menezes MBC. Optimal response against bioterror attack on airport terminal European Journal of Operational Research. 219: 415-424. DOI: 10.1016/J.Ejor.2011.12.036 |
0.412 |
|
| 2012 |
Berman O, Krass D, Tajbakhsh MM. A coordinated location-inventory model European Journal of Operational Research. 217: 500-508. DOI: 10.1016/J.Ejor.2011.09.039 |
0.39 |
|
| 2012 |
Zhang Y, Berman O, Verter V. The impact of client choice on preventive healthcare facility network design Or Spectrum. 34: 349-370. DOI: 10.1007/S00291-011-0280-1 |
0.468 |
|
| 2011 |
Berman O, Gavious A, Huang R. Location of response facilities: a simultaneous game between state and terrorist International Journal of Operational Research. 10: 102-120. DOI: 10.1504/Ijor.2011.037265 |
0.383 |
|
| 2011 |
Baron O, Berman O, Perry D. Shelf Space Management When Demand Depends on the Inventory Level Production and Operations Management. 20: 714-726. DOI: 10.1111/J.1937-5956.2010.01201.X |
0.373 |
|
| 2011 |
Berman O, Drezner Z, Krass D. Discrete cooperative covering problems Journal of the Operational Research Society. 62: 2002-2012. DOI: 10.1057/Jors.2010.176 |
0.456 |
|
| 2011 |
Berman O, Wang J. The minmax regret gradual covering location problem on a network with incomplete information of demand weights European Journal of Operational Research. 208: 233-238. DOI: 10.1016/J.Ejor.2010.08.016 |
0.497 |
|
| 2011 |
Berman O, Krass D. On n-facility median problem with facilities subject to failure facing uniform demand Discrete Applied Mathematics. 159: 420-432. DOI: 10.1016/J.Dam.2010.11.021 |
0.446 |
|
| 2011 |
Berman O, Ianovsky E, Krass D. Optimal search path for service in the presence of disruptions Computers & Operations Research. 38: 1562-1571. DOI: 10.1016/J.Cor.2011.01.015 |
0.538 |
|
| 2011 |
Berman O, Krass D, Wang J. The probabilistic gradual covering location problem on a network with discrete random demand weights Computers & Operations Research. 38: 1493-1500. DOI: 10.1016/J.Cor.2011.01.005 |
0.493 |
|
| 2011 |
Abouee-Mehrizi H, Babri S, Berman O, Shavandi H. Optimizing capacity, pricing and location decisions on a congested network with balking Mathematical Methods of Operations Research. 74: 233-255. DOI: 10.1007/S00186-011-0361-6 |
0.522 |
|
| 2011 |
Berman O, Drezner Z, Krass D. Big segment small segment global optimization algorithm on networks Networks. 58: 1-11. DOI: 10.1002/Net.20408 |
0.499 |
|
| 2011 |
Abouee-Mehrizi H, Berman O, Shavandi H, Zare AG. An exact analysis of a joint production‐inventory problem in two‐echelon inventory systems Naval Research Logistics. 58: 713-730. DOI: 10.1002/Nav.20477 |
0.365 |
|
| 2010 |
Zhang Y, Berman O, Marcotte P, Verter V. A bilevel model for preventive healthcare facility network design with congestion Iie Transactions (Institute of Industrial Engineers). 42: 865-880. DOI: 10.1080/0740817X.2010.491500 |
0.492 |
|
| 2010 |
Bigotte JF, Krass D, Antunes AP, Berman O. Integrated modeling of urban hierarchy and transportation network planning Transportation Research Part a-Policy and Practice. 44: 506-522. DOI: 10.1016/J.Tra.2010.03.020 |
0.427 |
|
| 2010 |
Berman O, Drezner Z, Krass D. Review: Generalized coverage: New developments in covering location models Computers & Operations Research. 37: 1675-1687. DOI: 10.1016/J.Cor.2009.11.003 |
0.354 |
|
| 2010 |
Berman O, Wang J. The network p-median problem with discrete probabilistic demand weights Computers & Operations Research. 37: 1455-1463. DOI: 10.1016/J.Cor.2009.10.007 |
0.483 |
|
| 2010 |
Baron O, Berman O, Perry D. Continuous review inventory models for perishable items ordered in batches Mathematical Methods of Operations Research. 72: 217-247. DOI: 10.1007/S00186-010-0318-1 |
0.387 |
|
| 2009 |
Arivudainambi D, Averbakh I, Berman O. Stationary analysis of a single server retrial queue with priority and vacation International Journal of Operational Research. 5: 26-47. DOI: 10.1504/Ijor.2009.024528 |
0.374 |
|
| 2009 |
Berman O, Krass D, Menezes MBC. Locating Facilities in the Presence of Disruptions and Incomplete Information Decision Sciences. 40: 845-868. DOI: 10.1111/J.1540-5915.2009.00253.X |
0.364 |
|
| 2009 |
Berman O, Drezner Z, Wesolowsky GO. The Maximal Covering Problem with Some Negative Weights Geographical Analysis. 41: 30-42. DOI: 10.1111/J.1538-4632.2009.00746.X |
0.393 |
|
| 2009 |
Berman O, Drezner T, Drezner Z, Wesolowsky GO. A defensive maximal covering problem on a network International Transactions in Operational Research. 16: 69-86. DOI: 10.1111/J.1475-3995.2009.00660.X |
0.478 |
|
| 2009 |
Berman O, Drezner Z, Krass D. Cooperative cover location problems: The planar case Iie Transactions. 42: 232-246. DOI: 10.1080/07408170903394355 |
0.451 |
|
| 2009 |
Pinker E, Lee H, Berman O. Can flexibility be constraining Iie Transactions. 42: 45-59. DOI: 10.1080/07408170903113789 |
0.33 |
|
| 2009 |
Baron O, Berman O, Kim S, Krass D. Ensuring feasibility in location problems with stochastic demands and congestion Iie Transactions. 41: 467-481. DOI: 10.1080/07408170802382758 |
0.518 |
|
| 2009 |
Antunes A, Berman O, Bigotte J, Krass D. A Location Model for Urban Hierarchy Planning with Population Dynamics Environment and Planning A. 41: 996-1016. DOI: 10.1068/A40303 |
0.348 |
|
| 2009 |
Zhang Y, Berman O, Verter V. Incorporating congestion in preventive healthcare facility network design European Journal of Operational Research. 198: 922-935. DOI: 10.1016/J.Ejor.2008.10.037 |
0.513 |
|
| 2009 |
Berman O, Drezner Z, Krass D, Wesolowsky GO. The variable radius covering problem European Journal of Operational Research. 196: 516-525. DOI: 10.1016/J.Ejor.2008.03.046 |
0.453 |
|
| 2009 |
Berman O, Kalcsics J, Krass D, Nickel S. The Ordered Gradual Covering Location Problem on a Network Discrete Applied Mathematics. 157: 3689-3707. DOI: 10.1016/J.Dam.2009.08.003 |
0.504 |
|
| 2009 |
Aboolian R, Berman O, Drezner Z. The multiple server center location problem Annals of Operations Research. 167: 337-352. DOI: 10.1007/S10479-008-0341-2 |
0.504 |
|
| 2009 |
Berman O, Drezner Z, Tamir A, Wesolowsky GO. Optimal location with equitable loads Annals of Operations Research. 167: 307-325. DOI: 10.1007/S10479-008-0339-9 |
0.449 |
|
| 2009 |
Aboolian R, Berman O, Krass D. Efficient solution approaches for a discrete multi-facility competitive interaction model Annals of Operations Research. 167: 297-306. DOI: 10.1007/S10479-008-0337-Y |
0.352 |
|
| 2008 |
Berman O, Ianovsky E. Optimal management of cross-trained workers, using Markov decision approach International Journal of Operational Research. 3: 154-182. DOI: 10.1504/Ijor.2008.016159 |
0.425 |
|
| 2008 |
Berman O, Perry D, Stadje W. Optimal replenishment in a Brownian Motion EOQ model with hysteretic parameter changes International Journal of Inventory Research. 1: 1. DOI: 10.1504/Ijir.2008.019205 |
0.306 |
|
| 2008 |
Baron O, Berman O, Krass D. Facility Location with Stochastic Demand and Constraints on Waiting Time Manufacturing & Service Operations Management. 10: 484-505. DOI: 10.1287/Msom.1070.0182 |
0.527 |
|
| 2008 |
Berman O, Drezner Z, Wang Q, Wesolowsky GO. The route expropriation problem Iie Transactions. 40: 468-477. DOI: 10.1080/07408170701592465 |
0.452 |
|
| 2008 |
Aboolian R, Berman O, Drezner Z. Location and allocation of service units on a congested network Iie Transactions. 40: 422-433. DOI: 10.1080/07408170701411385 |
0.519 |
|
| 2008 |
Aboolian R, Berman O, Krass D. Optimizing pricing and location decisions for competitive service facilities charging uniform price Journal of the Operational Research Society. 59: 1506-1519. DOI: 10.1057/Palgrave.Jors.2602493 |
0.453 |
|
| 2008 |
Berman O, Wang J. The probabilistic 1-maximal covering problem on a network with discrete demand weights Journal of the Operational Research Society. 59: 1398-1405. DOI: 10.1057/Palgrave.Jors.2602466 |
0.536 |
|
| 2008 |
Berman O, Drezner Z, Wesolowsky GO. The multiple location of transfer points Journal of the Operational Research Society. 59: 805-811. DOI: 10.1057/Palgrave.Jors.2602398 |
0.424 |
|
| 2008 |
Berman O, Drezner Z. A new formulation for the conditional p-median and p-center problems Operations Research Letters. 36: 481-483. DOI: 10.1016/J.Orl.2008.02.001 |
0.397 |
|
| 2008 |
Berman O, Drezner Z. The p-median problem under uncertainty European Journal of Operational Research. 189: 19-30. DOI: 10.1016/J.Ejor.2007.05.045 |
0.434 |
|
| 2008 |
Berman O, Wang Q. Locating a semi-obnoxious facility with expropriation Computers & Operations Research. 35: 392-403. DOI: 10.1016/J.Cor.2006.03.016 |
0.453 |
|
| 2008 |
Berman O, Huang R. The minimum weighted covering location problem with distance constraints Computers & Operations Research. 35: 356-372. DOI: 10.1016/J.Cor.2006.03.003 |
0.482 |
|
| 2007 |
Berman O, Huang R. The Minisum Multipurpose Trip Location Problem on Networks Transportation Science. 41: 500-515. DOI: 10.1287/Trsc.1060.0186 |
0.537 |
|
| 2007 |
Berman O, Krass D, Menezes MBC. Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects Operations Research. 55: 332-350. DOI: 10.1287/Opre.1060.0348 |
0.501 |
|
| 2007 |
Berman O, Huang R, Kim S, Menezes MBC. Locating capacitated facilities to maximize captured demand Iie Transactions. 39: 1015-1029. DOI: 10.1080/07408170601142650 |
0.54 |
|
| 2007 |
Berman O, Wang Q. Locating semi-obnoxious facilities with expropriation: minisum criterion Journal of the Operational Research Society. 58: 378-390. DOI: 10.1057/Palgrave.Jors.2602151 |
0.513 |
|
| 2007 |
Berman O, Drezner Z. The multiple server location problem Journal of the Operational Research Society. 58: 91-99. DOI: 10.1057/Palgrave.Jors.2602126 |
0.451 |
|
| 2007 |
Baron O, Berman O, Krass D, Wang Q. The equitable location problem on the plane European Journal of Operational Research. 183: 578-590. DOI: 10.1016/J.Ejor.2006.10.023 |
0.459 |
|
| 2007 |
Aboolian R, Berman O, Krass D. Competitive facility location and design problem European Journal of Operational Research. 182: 40-62. DOI: 10.1016/J.Ejor.2006.07.021 |
0.418 |
|
| 2007 |
Berman O, Gavious A. Location of terror response facilities: A game between state and terrorist European Journal of Operational Research. 177: 1113-1133. DOI: 10.1016/J.Ejor.2005.12.022 |
0.388 |
|
| 2007 |
Averbakh I, Berman O, Drezner Z, Wesolowsky GO. The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation European Journal of Operational Research. 179: 956-967. DOI: 10.1016/J.Ejor.2005.11.041 |
0.503 |
|
| 2007 |
Aboolian R, Berman O, Krass D. Competitive facility location model with concave demand European Journal of Operational Research. 181: 598-619. DOI: 10.1016/J.Ejor.2005.10.075 |
0.469 |
|
| 2007 |
Berman O, Drezner Z, Wesolowsky GO. The transfer point location problem European Journal of Operational Research. 179: 978-989. DOI: 10.1016/J.Ejor.2005.08.030 |
0.421 |
|
| 2007 |
Berman O, Verter V, Kara BY. Designing emergency response networks for hazardous materials transportation Computers & Operations Research. 34: 1374-1388. DOI: 10.1016/J.Cor.2005.06.006 |
0.437 |
|
| 2006 |
Berman O, Wang Q. Inbound Logistic Planning: Minimizing Transportation and Inventory Cost Transportation Science. 40: 287-299. DOI: 10.1287/Trsc.1050.0130 |
0.439 |
|
| 2006 |
Berman O, Krass D, Wang J. Locating service facilities to reduce lost demand Iie Transactions. 38: 933-946. DOI: 10.1080/07408170600856722 |
0.524 |
|
| 2006 |
Berman O, Drezner Z. Location of congested capacitated facilities with distance-sensitive demand Iie Transactions. 38: 213-221. DOI: 10.1080/07408170500288190 |
0.497 |
|
| 2006 |
Berman O, Wang J. The 1-Median And 1-Antimedian Problems With Continuous Probabilistic Demand Weights Infor. 44: 267-283. DOI: 10.1080/03155986.2006.11732752 |
0.458 |
|
| 2006 |
Berman O, Perry D, Stadje W. A Fluid EOQ Model With A Two-State Random Environment Probability in the Engineering and Informational Sciences. 20: 329-349. DOI: 10.1017/S0269964806060207 |
0.376 |
|
| 2006 |
Batta R, Berman O, Wang Q. Balancing staffing and switching costs in a service center with flexible servers European Journal of Operational Research. 177: 924-938. DOI: 10.1016/J.Ejor.2006.01.008 |
0.647 |
|
| 2006 |
Averbakh I, Berman O, Chernykh I. The routing open-shop problem on a network: Complexity and approximation European Journal of Operational Research. 173: 531-539. DOI: 10.1016/J.Ejor.2005.01.034 |
0.428 |
|
| 2006 |
Berman O, Perry D. An EOQ model with state-dependent demand rate European Journal of Operational Research. 171: 255-272. DOI: 10.1016/J.Ejor.2004.08.035 |
0.345 |
|
| 2005 |
Berman O, Drezner Z, Wesolowsky GO. The facility and transfer points location problem International Transactions in Operational Research. 12: 387-402. DOI: 10.1111/J.1475-3995.2005.00514.X |
0.399 |
|
| 2005 |
Berman O, Sapna-Isotupa KP. Optimal control of servers in front and back rooms with correlated work Iie Transactions. 37: 167-173. DOI: 10.1080/07408170590885639 |
0.496 |
|
| 2005 |
Averbakh I, Berman O, Chernykh I. The m-machine flowshop problem with unit-time operations and intree precedence constraints Operations Research Letters. 33: 263-266. DOI: 10.1016/J.Orl.2004.08.001 |
0.393 |
|
| 2005 |
Berman O, Wang J, Sapna KP. Optimal management of cross-trained workers in services with negligible switching costs European Journal of Operational Research. 167: 349-369. DOI: 10.1016/J.Ejor.2004.03.024 |
0.481 |
|
| 2005 |
Averbakh I, Berman O, Chernykh I. A -approximation algorithm for the two-machine routing open-shop problem on a two-node network European Journal of Operational Research. 166: 3-24. DOI: 10.1016/J.Ejor.2003.06.050 |
0.453 |
|
| 2005 |
Berman O, Parlar M, Perry D, Posner MJM. Production/Clearing Models Under Continuous and Sporadic Reviews Methodology and Computing in Applied Probability. 7: 203-224. DOI: 10.1007/S11009-005-1483-1 |
0.371 |
|
| 2005 |
Berman O, Krass D. An Improved IP Formulation for the Uncapacitated Facility Location Problem: Capitalizing on Objective Function Structure Annals of Operations Research. 136: 21-34. DOI: 10.1007/S10479-005-2036-2 |
0.415 |
|
| 2004 |
Berman O, Huang R. Minisum collection depots location problem with multiple facilities on a network Journal of the Operational Research Society. 55: 769-779. DOI: 10.1057/Palgrave.Jors.2601742 |
0.564 |
|
| 2004 |
Berman O, Larson RC. A queueing control model for retail services having back room operations and cross-trained workers Computers & Operations Research. 31: 201-222. DOI: 10.1016/S0305-0548(02)00180-6 |
0.651 |
|
| 2004 |
Berman O, Kim E. Dynamic inventory strategies for profit maximization in a service facility with stochastic service, demand and lead time Mathematical Methods of Operations Research. 60: 497-521. DOI: 10.1007/S001860400369 |
0.458 |
|
| 2004 |
Berman O, Wang J. Probabilistic location problems with discrete demand weights Networks. 44: 47-57. DOI: 10.1002/Net.20015 |
0.484 |
|
| 2003 |
Berman O, Drezner Z, Wesolowsky GO. The Expected Maximum Distance Objective in Facility Location Journal of Regional Science. 43: 735-748. DOI: 10.1111/J.0022-4146.2003.00318.X |
0.484 |
|
| 2003 |
Berman O, Drezner Z, Wang J, Wesolowsky GO. The Minimax and Maximin Location Problems on a Network with Uniform Distributed Weights Iie Transactions. 35: 1017-1025. DOI: 10.1080/07408170304397 |
0.444 |
|
| 2003 |
Berman O, Vasudeva S. Approximating Performance Measures for a Network of Unreliable Machines Iie Transactions. 35: 665-677. DOI: 10.1080/07408170304360 |
0.775 |
|
| 2003 |
Berman O, Drezner Z. A probabilistic one-centre location problem on a network Journal of the Operational Research Society. 54: 871-877. DOI: 10.1057/Palgrave.Jors.2601594 |
0.5 |
|
| 2003 |
Berman O, Drezner Z, Wesolowsky GO. The expropriation location problem Journal of the Operational Research Society. 54: 769-776. DOI: 10.1057/Palgrave.Jors.2601548 |
0.478 |
|
| 2003 |
Berman O, Wang J, Drezner Z, Wesolowsky GO. A Probabilistic Minimax Location Problem on the Plane Annals of Operations Research. 122: 59-70. DOI: 10.1023/A:1026134121255 |
0.4 |
|
| 2003 |
Berman O, Krass D, Drezner Z. The gradual covering decay location problem on a network European Journal of Operational Research. 151: 474-480. DOI: 10.1016/S0377-2217(02)00604-5 |
0.388 |
|
| 2003 |
Berman O, Drezner Z, Wesolowsky GO. Locating service facilities whose reliability is distance dependent Computers & Operations Research. 30: 1683-1695. DOI: 10.1016/S0305-0548(02)00099-0 |
0.5 |
|
| 2003 |
Berman O, Krass D, Perry D. A transfer/clearing inventory model under sporadic review Mathematical Methods of Operations Research. 57: 329-344. DOI: 10.1007/S001860200266 |
0.361 |
|
| 2003 |
Averbakh I, Berman O. An improved algorithm for the minmax regret median problem on a tree Networks. 41: 97-103. DOI: 10.1002/Net.10062 |
0.369 |
|
| 2002 |
Berman O, Drezner Z, Wesolowsky GO. Satisfying partial demand in facilities location Iie Transactions. 34: 971-978. DOI: 10.1080/07408170208928926 |
0.487 |
|
| 2002 |
Berman O, Krass D. Locating Multiple Competitive Facilities: Spatial Interaction Models with Variable Expenditures Annals of Operations Research. 111: 197-225. DOI: 10.1023/A:1020957904442 |
0.345 |
|
| 2002 |
Averbakh I, Berman O. Minmax p-Traveling Salesmen Location Problems on a Tree Annals of Operations Research. 110: 55-68. DOI: 10.1023/A:1020759332183 |
0.416 |
|
| 2002 |
Berman O, Krass D. The generalized maximal covering location problem Computers & Operations Research. 29: 563-581. DOI: 10.1016/S0305-0548(01)00079-X |
0.457 |
|
| 2002 |
Averbakh I, Berman O. Parallel NC‐algorithms for multifacility location problems with mutual communication and their applications Networks. 40: 1-12. DOI: 10.1002/Net.10027 |
0.41 |
|
| 2002 |
Berman O, Sapna KP. Optimal service rates of a service facility with perishable inventory items Naval Research Logistics. 49: 464-482. DOI: 10.1002/Nav.10021 |
0.488 |
|
| 2002 |
Berman O, Drezner Z, Wesolowsky GO. The collection depots location problem on networks Naval Research Logistics. 49: 15-24. DOI: 10.1002/Nav.10000 |
0.523 |
|
| 2001 |
Berman O, Larson RC. Deliveries in an Inventory/Routing Problem Using Stochastic Dynamic Programming Transportation Science. 35: 192-213. DOI: 10.1287/Trsc.35.2.192.10134 |
0.629 |
|
| 2001 |
Berman O, Drezner Z, Wesolowsky GO. Location of facilities on a network with groups of demand points Iie Transactions. 33: 637-648. DOI: 10.1023/A:1010927114887 |
0.433 |
|
| 2001 |
Berman O, Sapna KP. Optimal control of service for facility holding inventory Computers & Operations Research. 28: 429-441. DOI: 10.1016/S0305-0548(99)00128-8 |
0.487 |
|
| 2001 |
Berman O, Kim E. Dynamic order replenishment policy in internet-based supply chains Mathematical Methods of Operations Research. 53: 371-390. DOI: 10.1007/S001860100116 |
0.442 |
|
| 2000 |
Averbakh I, Berman O. Minmax Regret Median Location on a Network Under Uncertainty Informs Journal On Computing. 12: 104-110. DOI: 10.1287/Ijoc.12.2.104.11897 |
0.456 |
|
| 2000 |
Berman O, Sapna KP. Inventory management at service facilities for systems with arbitrarily distributed service times Stochastic Models. 16: 343-360. DOI: 10.1080/15326340008807592 |
0.436 |
|
| 2000 |
Berman O, Drezner Z, Wesolowsky GO. Routing and location on a network with hazardous threats Journal of the Operational Research Society. 51: 1093-1099. DOI: 10.1057/Palgrave.Jors.2601003 |
0.406 |
|
| 2000 |
Averbakh I, Berman O. Algorithms for the robust 1-center problem on a tree European Journal of Operational Research. 123: 292-302. DOI: 10.1016/S0377-2217(99)00257-X |
0.45 |
|
| 2000 |
Berman O, Drezner Z. A note on the location of an obnoxious facility on a network European Journal of Operational Research. 120: 215-217. DOI: 10.1016/S0377-2217(98)00237-9 |
0.392 |
|
| 1999 |
Averbakh I, Berman O. A Simple Heuristic for M -Machine Flow-Shop and its Applications in Routing-Scheduling Problems Operations Research. 47: 165-170. DOI: 10.1287/Opre.47.1.165 |
0.429 |
|
| 1999 |
Averbakh I, Berman O. Parallel Complexity of Additive Location Problems Informs Journal On Computing. 11: 292-298. DOI: 10.1287/Ijoc.11.3.292 |
0.41 |
|
| 1999 |
Berman O, Kim E. Stochastic models for inventory management at service facilities Stochastic Models. 15: 695-718. DOI: 10.1080/15326349908807558 |
0.451 |
|
| 1999 |
Averbakh I, Berman O. Algorithms for path medi-centers of a tree Computers & Operations Research. 26: 1395-1409. DOI: 10.1016/S0305-0548(99)00042-8 |
0.403 |
|
| 1999 |
Berman O, Kumar UD. Optimization models for complex recovery block schemes Computers & Operations Research. 26: 525-544. DOI: 10.1016/S0305-0548(98)00074-4 |
0.364 |
|
| 1998 |
Berman O, Kumar UD. Reliability analysis of communicating recovery blocks Ieee Transactions On Reliability. 47: 245-254. DOI: 10.1109/24.740494 |
0.33 |
|
| 1998 |
Berman O, Krass D. Flow intercepting spatial interaction model: a new approach to optimal location of competitive facilities Location Science. 6: 41-65. DOI: 10.1016/S0966-8349(98)00047-3 |
0.429 |
|
| 1998 |
Averbakh I, Berman O, Drezner Z, Wesolowsky GO. The plant location problem with demand-dependent setup costs and centralized allocation European Journal of Operational Research. 111: 543-554. DOI: 10.1016/S0377-2217(97)00361-5 |
0.53 |
|
| 1998 |
Berman O, Cutler M. Optimal software implementation considering reliability and cost Computers & Operations Research. 25: 857-868. DOI: 10.1016/S0305-0548(97)00099-3 |
0.322 |
|
| 1998 |
Averbakh I, Berman O. Location problems with grouped structure of demand : Complexity and algorithms Networks. 31: 81-92. DOI: 10.1002/(Sici)1097-0037(199803)31:2<81::Aid-Net3>3.0.Co;2-F |
0.451 |
|
| 1997 |
Berman O, Larson RC, Pinker E. Scheduling workforce and workflow in a high volume factory Management Science. 43: 158-172. DOI: 10.1287/Mnsc.43.2.158 |
0.626 |
|
| 1997 |
Berman O, Krass D, Xu CW. Generalized flow-interception facility location models with probabilistic customer flows Stochastic Models. 13: 1-25. DOI: 10.1080/15326349708807410 |
0.353 |
|
| 1997 |
Berman O. Deterministic flow-demand location problems Journal of the Operational Research Society. 48: 75-81. DOI: 10.1057/Palgrave.Jors.2600324 |
0.551 |
|
| 1997 |
Averbakh I, Berman O. Minimax regret p-center location on a network with demand uncertainty Location Science. 5: 247-254. DOI: 10.1016/S0966-8349(98)00033-3 |
0.454 |
|
| 1997 |
Averbakh I, Berman O. ( p -1)/( p +1)-approximate algorithms for p -traveling salemen problems on a tree with minmax objective Discrete Applied Mathematics. 75: 201-216. DOI: 10.1016/S0166-218X(97)89161-5 |
0.363 |
|
| 1996 |
Averbakh I, Berman O. Routing Two-Machine Flowshop Problems on Networks with Special Structure Transportation Science. 30: 303-314. DOI: 10.1287/Trsc.30.4.303 |
0.394 |
|
| 1996 |
Averbakh I, Berman O. Technical Note—A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree Transportation Science. 30: 261-269. DOI: 10.1287/Trsc.30.3.261 |
0.402 |
|
| 1996 |
Averbakh I, Berman O. Bottleneck Steiner Subnetwork Problems with k-Connectivity Constraints Informs Journal On Computing. 8: 361-366. DOI: 10.1287/Ijoc.8.4.361 |
0.309 |
|
| 1996 |
Berman O, Cutler M. Choosing an optimal set of libraries Ieee Transactions On Reliability. 45: 303-307. DOI: 10.1109/24.510818 |
0.374 |
|
| 1996 |
Averbakh I, Berman O. Locating flow-capturing units on a network with multi-counting and diminishing returns to scale European Journal of Operational Research. 91: 495-506. DOI: 10.1016/0377-2217(94)00369-6 |
0.509 |
|
| 1996 |
Averbakh I, Berman O. A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree Discrete Applied Mathematics. 68: 17-32. DOI: 10.1016/0166-218X(95)00054-U |
0.395 |
|
| 1996 |
Berman O, Drezner Z, Wesolowsky GO. Minimum covering criterion for obnoxious facility location on a network Networks. 28: 1-5. DOI: 10.1002/(Sici)1097-0037(199608)28:1<1::Aid-Net1>3.0.Co;2-J |
0.482 |
|
| 1995 |
Berman O, Krass D, Xu CW. Locating Discretionary Service Facilities Based on Probabilistic Customer Flows Transportation Science. 29: 276-290. DOI: 10.1287/Trsc.29.3.276 |
0.516 |
|
| 1995 |
Averbakh I, Berman O. Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree Transportation Science. 29: 184-197. DOI: 10.1287/Trsc.29.2.184 |
0.52 |
|
| 1995 |
Berman O, Bertsimas D, Larson RC. Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience Operations Research. 43: 623-632. DOI: 10.1287/Opre.43.4.623 |
0.74 |
|
| 1995 |
Averbakh I, Berman O, Punnen AP. Constrained matroidal bottleneck problems Discrete Applied Mathematics. 63: 201-214. DOI: 10.1016/0166-218X(95)00114-4 |
0.405 |
|
| 1995 |
Berman O, Krass D, Xu CW. Locating flow-intercepting facilities: New approaches and results Annals of Operations Research. 60: 121-143. DOI: 10.1007/Bf02031943 |
0.421 |
|
| 1995 |
Wagner JM, Berman O. Models for planning capacity expansion of convenience stores under uncertain demand and the value of information Annals of Operations Research. 59: 19-44. DOI: 10.1007/Bf02031742 |
0.389 |
|
| 1995 |
Averbakh I, Berman O. Sales‐delivery man problems on treelike networks Networks. 25: 45-58. DOI: 10.1002/Net.3230250204 |
0.521 |
|
| 1994 |
Averbakh I, Berman O. Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path Transportation Science. 28: 162-166. DOI: 10.1287/Trsc.28.2.162 |
0.451 |
|
| 1994 |
Ashrafi N, Berman O, Cutler M. Optimal design of large software-systems using N-version programming Ieee Transactions On Reliability. 43: 344-350. DOI: 10.1109/24.295021 |
0.314 |
|
| 1994 |
Berman O. The p maximal cover - p partial center problem on networks European Journal of Operational Research. 72: 432-442. DOI: 10.1016/0377-2217(94)90321-2 |
0.47 |
|
| 1994 |
Berman O, Larson RC. Determining optimal pool size of a temporary call-in work force European Journal of Operational Research. 73: 55-64. DOI: 10.1016/0377-2217(94)90142-2 |
0.615 |
|
| 1994 |
Berman O, Ganz Z. The capacity expansion problem in the service industry Computers & Operations Research. 21: 557-572. DOI: 10.1016/0305-0548(94)90104-X |
0.492 |
|
| 1994 |
Averbakh I, Berman O. Categorized bottleneck-minisum path problems on networks Operations Research Letters. 16: 291-297. DOI: 10.1016/0167-6377(94)90043-4 |
0.448 |
|
| 1994 |
Berman O, Ingco DI, Odoni AR. Improving the location of minimax facilities through network modification Networks. 24: 31-41. DOI: 10.1002/Net.3230240105 |
0.681 |
|
| 1994 |
Averbakh I, Berman O, Simchi-Levi D. Probabilistic a priori routing‐location problems Naval Research Logistics. 41: 973-989. DOI: 10.1002/1520-6750(199412)41:7<973::Aid-Nav3220410709>3.0.Co;2-H |
0.389 |
|
| 1994 |
Berman O, Ganz Z, Wagner JM. A stochastic optimization model for planning capacity expansion in a service industry under uncertain demand Naval Research Logistics. 41: 545-564. DOI: 10.1002/1520-6750(199406)41:4<545::Aid-Nav3220410407>3.0.Co;2-Z |
0.477 |
|
| 1993 |
Berman O, Ashrafi N. Optimization models for reliability of modular software systems Ieee Transactions On Software Engineering. 19: 1119-1123. DOI: 10.1109/32.256858 |
0.343 |
|
| 1993 |
Berman O, Kaplan EH, Shevishak DG. Deterministic Approximations For Inventory Management At Service Facilities Iie Transactions. 25: 98-104. DOI: 10.1080/07408179308964320 |
0.456 |
|
| 1993 |
Berman O, Larson RC. Optimal workforce configuration incorporating absenteeism and daily workload variability Socio-Economic Planning Sciences. 27: 91-96. DOI: 10.1016/0038-0121(93)90009-8 |
0.627 |
|
| 1993 |
Berman O, Ingco DI, Odoni AR. Improving the location of minisum facilities through network modification Annals of Operations Research. 40: 1-16. DOI: 10.1007/Bf02060467 |
0.727 |
|
| 1992 |
Berman O, Larson RC, Fouska N. Optimal Location of Discretionary Service Facilities Transportation Science. 26: 201-211. DOI: 10.1287/Trsc.26.3.201 |
0.679 |
|
| 1992 |
Ashrafi N, Berman O. Optimization models for selection of programs, considering cost and reliability Ieee Transactions On Reliability. 41: 281-287. DOI: 10.1109/24.257794 |
0.323 |
|
| 1992 |
Ganz Z, Berman O. The capacity expansion problem in the service industry with multiple resource constraints Socio-Economic Planning Sciences. 26: 1-14. DOI: 10.1016/0038-0121(92)90022-W |
0.507 |
|
| 1991 |
Simchi-Levi D, Berman O. Minimizing the total flow time of n jobs on a network Iie Transactions (Institute of Industrial Engineers). 23: 236-244. DOI: 10.1080/07408179108963858 |
0.365 |
|
| 1991 |
Berman O, Yang EK. Medi-centre Location Problems Journal of the Operational Research Society. 42: 313-322. DOI: 10.1057/Jors.1991.69 |
0.436 |
|
| 1991 |
Berman O, Einav D, Handler G. The zone-constrained location problem on a network European Journal of Operational Research. 53: 14-24. DOI: 10.1016/0377-2217(91)90089-E |
0.43 |
|
| 1990 |
Berman O. Mean-Variance Location Problems Transportation Science. 24: 287-293. DOI: 10.1287/Trsc.24.4.287 |
0.422 |
|
| 1990 |
Berman O, Kaplan EH. Equity Maximizing Facility Location Schemes Transportation Science. 24: 137-144. DOI: 10.1287/Trsc.24.2.137 |
0.439 |
|
| 1990 |
Berman O, Simchi-Levi D. Technical Note—Conditional Location Problems on Networks Transportation Science. 24: 77-78. DOI: 10.1287/Trsc.24.1.77 |
0.461 |
|
| 1990 |
Berman O, Einav D, Handler G. The Constrained Bottleneck Problem in Networks Operations Research. 38: 178-181. DOI: 10.1287/Opre.38.1.178 |
0.458 |
|
| 1990 |
Simchi-Levi D, Berman O. Optimal locations and districts of two traveling salesmen on a tree Networks. 20: 803-815. DOI: 10.1002/Net.3230200702 |
0.452 |
|
| 1989 |
Berman O, Simchi-Levi D. The Traveling Salesman Location Problem on Stochastic Networks Transportation Science. 23: 54-57. DOI: 10.1287/Trsc.23.1.54 |
0.475 |
|
| 1989 |
Batta R, Berman O. A location model for a facility operating as anM/G/k queue Networks. 19: 717-728. DOI: 10.1002/Net.3230190609 |
0.625 |
|
| 1988 |
Berman O, Simchi-Levi D. Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers Transportation Science. 22: 148-154. DOI: 10.1287/Trsc.22.2.148 |
0.451 |
|
| 1988 |
Simchi-Levi D, Berman O. A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks Operations Research. 36: 478-484. DOI: 10.1287/Opre.36.3.478 |
0.554 |
|
| 1988 |
Kaplan EH, Berman O. OR Hits the Heights: Relocation Planning at the Orient Heights Housing Project Interfaces. 18: 14-22. DOI: 10.1287/Inte.18.6.14 |
0.345 |
|
| 1988 |
Berman O, Jewkes B. Optimal M/G/1 Server Location on a Network Having a Fixed Facility Journal of the Operational Research Society. 39: 1137-1146. DOI: 10.1057/Jors.1988.190 |
0.537 |
|
| 1988 |
Berman O, Simchi-Levi D. Minisum location of a travelling salesman on simple networks European Journal of Operational Research. 36: 241-250. DOI: 10.1016/0377-2217(88)90430-4 |
0.486 |
|
| 1988 |
Berman O, Sichi-Levi D, Tamir A. The minimax multistop location problem on a tree Networks. 18: 39-49. DOI: 10.1002/Net.3230180106 |
0.516 |
|
| 1987 |
Ahituv N, Berman O. Devising a cooperation policy for emergency networks. The Journal of the Operational Research Society. 38: 1015-29. PMID 10302092 DOI: 10.1057/Jors.1987.172 |
0.434 |
|
| 1987 |
Berman O, Larson RC, Parkan C. The Stochastic Queue p -Median Problem Transportation Science. 21: 207-216. DOI: 10.1287/Trsc.21.3.207 |
0.711 |
|
| 1987 |
Berman O, Handler GY. Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations Transportation Science. 21: 115-122. DOI: 10.1287/Trsc.21.2.115 |
0.482 |
|
| 1987 |
Simchi-Levi D, Berman O. Heuristics and bounds for the travelling salesman location problem on the plane Operations Research Letters. 6: 243-248. DOI: 10.1016/0167-6377(87)90056-3 |
0.402 |
|
| 1986 |
Parkan C, Berman O. Simulation of urban service operations for locational decisions Simulation. 46: 61-65. DOI: 10.1177/003754978604600202 |
0.449 |
|
| 1986 |
Berman O, Schnabel JA. Mean-variance analysis and the single-period inventory problem International Journal of Systems Science. 17: 1145-1151. DOI: 10.1080/00207728608926877 |
0.375 |
|
| 1986 |
Berman O, Mandowsky RR. Location-allocation on congested networks European Journal of Operational Research. 26: 238-250. DOI: 10.1016/0377-2217(86)90185-2 |
0.529 |
|
| 1986 |
Berman O, Levi DS. Minisum location of a traveling salesman Networks. 16: 239-254. DOI: 10.1002/Net.3230160302 |
0.449 |
|
| 1985 |
Berman O, Larson RC. Optimal 2-Facility Network Districting In The Presence Of Queuing Transportation Science. 19: 261-277. DOI: 10.1287/Trsc.19.3.261 |
0.705 |
|
| 1985 |
Berman O, Rahnama MR. Optimal Location-Relocation Decisions on Stochastic Networks Transportation Science. 19: 203-221. DOI: 10.1287/Trsc.19.3.203 |
0.461 |
|
| 1985 |
Berman O, Larson RC, Chiu SS. Optimal Server Location on a Network Operating as an M/G/1 Queue Operations Research. 33: 746-771. DOI: 10.1287/Opre.33.4.746 |
0.701 |
|
| 1985 |
Chiu SS, Berman O, Larson RC. Locating a Mobile Server Queueing Facility on a Tree Network Management Science. 31: 764-772. DOI: 10.1287/Mnsc.31.6.764 |
0.708 |
|
| 1985 |
Adar Z, Ahituv N, Berman O. The value of an information system for service networks Computers and Operations Research. 12: 71-85. DOI: 10.1016/0305-0548(85)90008-5 |
0.432 |
|
| 1985 |
Berman O. Locating a facility on a congested network with random lengths Networks. 15: 275-293. DOI: 10.1002/Net.3230150302 |
0.481 |
|
| 1984 |
Berman O, LeBlanc B. Location-Relocation of Mobile Facilities on a Stochastic Network Transportation Science. 18: 315-330. DOI: 10.1287/Trsc.18.4.315 |
0.485 |
|
| 1983 |
Berman O, Rahnama MR. Optimal Path of a Single Service Unit on a Network to a “Nonemergency” Destination Transportation Science. 17: 218-232. DOI: 10.1287/Trsc.17.2.218 |
0.507 |
|
| 1983 |
Berman O, Rahnama MR. A procedure for dispatching moving mobile servers Networks. 13: 121-141. DOI: 10.1002/Net.3230130108 |
0.398 |
|
| 1982 |
Berman O. Dispatching Service Units on Networks Using Perfect Real Time Location Information Infor. 20: 357-369. DOI: 10.1080/03155986.1982.11731873 |
0.478 |
|
| 1982 |
Berman O. Efficiency and production rate of a transfer line with two machines and a finite storage buffer European Journal of Operational Research. 9: 295-308. DOI: 10.1016/0377-2217(82)90038-8 |
0.325 |
|
| 1982 |
Berman O, Larson RC. The median problem with congestion Computers & Operations Research. 9: 119-126. DOI: 10.1016/0305-0548(82)90010-7 |
0.727 |
|
| 1982 |
Berman O, Odoni AR. Locating mobile servers on a network with markovian properties Networks. 12: 73-86. DOI: 10.1002/Net.3230120106 |
0.753 |
|
| 1981 |
Berman O. Dynamic Repositioning of Indistinguishable Service Units on Transportation Networks Transportation Science. 15: 115-136. DOI: 10.1287/Trsc.15.2.115 |
0.459 |
|
| 1981 |
Berman O, Parkan C. A Facility Location Problem With Distance-Dependent Demand Decision Sciences. 12: 623-632. DOI: 10.1111/J.1540-5915.1981.Tb00114.X |
0.512 |
|
| 1981 |
Berman O. Repositioning of Two Distinguishable Service Vehicles on Networks Ieee Transactions On Systems, Man, and Cybernetics. 11: 187-193. DOI: 10.1109/TSMC.1981.4308651 |
0.329 |
|
| 1981 |
Gershwin SB, Berman O. Analysis of Transfer Lines Consisting of Two Unreliable Machines with Random Processing Times and Finite Storage Buffers Iie Transactions. 13: 2-11. DOI: 10.1080/05695558108974530 |
0.315 |
|
| 1981 |
Berman O, Larson RC, Odoni AR. Developments in network location with mobile and congested facilities European Journal of Operational Research. 6: 104-116. DOI: 10.1016/0377-2217(81)90196-X |
0.789 |
|
| 1981 |
Berman O. Repositioning of distinguishable urban service units on networks Computers & Operations Research. 8: 105-118. DOI: 10.1016/0305-0548(81)90038-1 |
0.509 |
|
| Show low-probability matches. |