default search action
Oded Berman
Person information
- affiliation: University of Toronto, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [j160]Opher Baron
, Oded Berman, Mehdi Nourinejad
Introducing Autonomous Vehicles: Adoption Patterns and Impacts on Social Welfare. Manuf. Serv. Oper. Manag. 24(1): 352-369 (2022) - [j159]Oded Berman, Jiamin Wang
The multifacility center problems with random demand weights. Networks 79(4): 432-451 (2022) - [j158]Robert Aboolian
Probabilistic Set Covering Location Problem in Congested Networks. Transp. Sci. 56(2): 528-542 (2022) - 2021
- [j157]Igor Averbakh
Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams. Discret. Appl. Math. 300: 36-55 (2021) - [j156]Robert Aboolian
Optimizing facility location and design. Eur. J. Oper. Res. 289(1): 31-43 (2021)
2010 – 2019
- 2019
- [j155]Opher Baron
Almost Robust Discrete Optimization. Eur. J. Oper. Res. 276(2): 451-465 (2019) - [j154]Oded Berman, Zvi Drezner, Dmitry Krass:
The multiple gradual cover location problem. J. Oper. Res. Soc. 70(6): 931-940 (2019) - [j153]Oded Berman, Mohammad M. Fazel-Zarandi
Truthful Cheap Talk: Why Operational Flexibility May Lead to Truthful Communication. Manag. Sci. 65(4): 1624-1641 (2019) - [j152]Jianfu Wang
Tandem queues with impatient customers. Perform. Evaluation 135 (2019) - 2018
- [j151]Igor Averbakh, Oded Berman, Marina Leal
Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights. Discret. Appl. Math. 239: 193-199 (2018) - [j150]Vahid Sarhangian
Threshold-Based Allocation Policies for Inventory Management of Red Blood Cells. Manuf. Serv. Oper. Manag. 20(2): 347-362 (2018) - [i1]Amir Ahmadi-Javid, Oded Berman, Pooya Hoseinpour:
Location and Capacity Planning of Facilities with General Service-Time Distributions Using Conic Optimization. CoRR abs/1809.00080 (2018) - 2017
- [j149]Opher Baron
Strategic Idleness and Dynamic Scheduling in an Open-Shop Service Network: Case Study and Analysis. Manuf. Serv. Oper. Manag. 19(1): 52-71 (2017) - [j148]Ata G. Zare, Hossein Abouee-Mehrizi, Oded Berman:
Exact analysis of the (R, Q) inventory policy in a two-echelon production-inventory system. Oper. Res. Lett. 45(4): 308-314 (2017) - 2016
- [j147]Oded Berman, Jörg Kalcsics
On covering location problems on networks with edge demand. Comput. Oper. Res. 74: 214-227 (2016) - [j146]Opher Baron
Bargaining within the Supply Chain and Its Implications in an Industry. Decis. Sci. 47(2): 193-218 (2016) - [j145]Robert Aboolian
Maximal Accessibility Network Design in the Public Sector. Transp. Sci. 50(1): 336-347 (2016) - 2015
- [j144]Hossein Abouee-Mehrizi, Oded Berman, Shrutivandana Sharma:
Optimal Joint Replenishment and Transshipment Policies in a Multi-Period Inventory System with Lost Sales. Oper. Res. 63(2): 342-350 (2015) - [j143]Igor Averbakh, Oded Berman, Jörg Kalcsics
Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand. Oper. Res. 63(2): 394-411 (2015) - 2014
- [j142]Opher Baron
Using Strategic Idleness to Improve Customer Service Experience in Service Networks. Oper. Res. 62(1): 123-140 (2014) - [j141]Vahideh Sadat Abedi, Oded Berman, Dmitry Krass:
Supporting New Product or Service Introductions: Location, Marketing, and Word of Mouth. Oper. Res. 62(5): 994-1013 (2014) - [j140]Hossein Abouee-Mehrizi, Opher Baron
Exact Analysis of Capacitated Two-Echelon Inventory Systems with Priorities. Manuf. Serv. Oper. Manag. 16(4): 561-577 (2014) - [j139]Mojtaba Araghi
Minisum multipurpose trip location problem on trees. Networks 63(2): 154-159 (2014) - [j138]Igor Averbakh, Oded Berman, Dmitry Krass, Jörg Kalcsics
Cooperative covering problems on networks. Networks 63(4): 334-349 (2014) - [j137]Hossein Abouee-Mehrizi, Oded Berman, M. Reza Baharnemati:
Designing Production-Inventory-Transportation Systems with Capacitated Cross-Docks. Transp. Sci. 48(1): 121-135 (2014) - 2013
- [j136]Oded Berman, Zvi Drezner, Dmitry Krass:
Continuous covering and cooperative covering problems with a general decay function on networks. J. Oper. Res. Soc. 64(11): 1644-1653 (2013) - 2012
- [j135]Oded Berman, Nima Sanajian, Hossein Abouee-Mehrizi:
Do Shareholders Really Prefer Their Executives to Maximize the Equity Value? A Newsvendor Case. Decis. Sci. 43(3): 395-436 (2012) - [j134]Oded Berman, Dmitry Krass, M. Mahdi Tajbakhsh:
A coordinated location-inventory model. Eur. J. Oper. Res. 217(3): 500-508 (2012) - [j133]Oded Berman, Arieh Gavious, Mozart B. C. Menezes
Optimal response against bioterror attack on airport terminal. Eur. J. Oper. Res. 219(2): 415-424 (2012) - [j132]Yue Zhang, Oded Berman, Vedat Verter:
The impact of client choice on preventive healthcare facility network design. OR Spectr. 34(2): 349-370 (2012) - [j131]Robert Aboolian
Profit Maximizing Distributed Service System Design with Congestion and Elastic Demand. Transp. Sci. 46(2): 247-261 (2012) - 2011
- [j130]Oded Berman, Dmitry Krass, Jiamin Wang:
The probabilistic gradual covering location problem on a network with discrete random demand weights. Comput. Oper. Res. 38(11): 1493-1500 (2011) - [j129]Oded Berman, Eduard Ianovsky, Dmitry Krass:
Optimal search path for service in the presence of disruptions. Comput. Oper. Res. 38(11): 1562-1571 (2011) - [j128]Oded Berman, Dmitry Krass:
On n-facility median problem with facilities subject to failure facing uniform demand. Discret. Appl. Math. 159(6): 420-432 (2011) - [j127]Oded Berman, Jiamin Wang:
The minmax regret gradual covering location problem on a network with incomplete information of demand weights. Eur. J. Oper. Res. 208(3): 233-238 (2011) - [j126]Oded Berman, Zvi Drezner, Dmitry Krass:
Discrete cooperative covering problems. J. Oper. Res. Soc. 62(11): 2002-2012 (2011) - [j125]Hossein Abouee-Mehrizi, Sahar Babri
Optimizing capacity, pricing and location decisions on a congested network with balking. Math. Methods Oper. Res. 74(2): 233-255 (2011) - [j124]Oded Berman, Zvi Drezner, Dmitry Krass:
Big segment small segment global optimization algorithm on networks. Networks 58(1): 1-11 (2011) - 2010
- [j123]Oded Berman, Jiamin Wang:
The network p-median problem with discrete probabilistic demand weights. Comput. Oper. Res. 37(8): 1455-1463 (2010) - [j122]Oded Berman, Zvi Drezner, Dmitry Krass:
Generalized coverage: New developments in covering location models. Comput. Oper. Res. 37(10): 1675-1687 (2010) - [j121]Opher Baron
Continuous review inventory models for perishable items ordered in batches. Math. Methods Oper. Res. 72(2): 217-247 (2010)
2000 – 2009
- 2009
- [j120]Robert Aboolian
Efficient solution approaches for a discrete multi-facility competitive interaction model. Ann. Oper. Res. 167(1): 297-306 (2009) - [j119]Oded Berman, Zvi Drezner, Arie Tamir, George O. Wesolowsky:
Optimal location with equitable loads. Ann. Oper. Res. 167(1): 307-325 (2009) - [j118]Robert Aboolian
The multiple server center location problem. Ann. Oper. Res. 167(1): 337-352 (2009) - [j117]Oded Berman, Jörg Kalcsics
The Ordered Gradual Covering Location Problem on a Network. Discret. Appl. Math. 157(18): 3689-3707 (2009) - [j116]Oded Berman, Dmitry Krass, Mozart B. C. Menezes
Locating Facilities in the Presence of Disruptions and Incomplete Information. Decis. Sci. 40(4): 845-868 (2009) - [j115]Oded Berman, Zvi Drezner, Dmitry Krass, George O. Wesolowsky:
The variable radius covering problem. Eur. J. Oper. Res. 196(2): 516-525 (2009) - [j114]Desheng Wu
Bargaining in competing supply chains with uncertainty. Eur. J. Oper. Res. 197(2): 548-556 (2009) - [j113]Yue Zhang, Oded Berman, Vedat Verter:
Incorporating congestion in preventive healthcare facility network design. Eur. J. Oper. Res. 198(3): 922-935 (2009) - [j112]Oded Berman, Tammy Drezner, Zvi Drezner, George O. Wesolowsky:
A defensive maximal covering problem on a network. Int. Trans. Oper. Res. 16(1): 69-86 (2009) - 2008
- [j111]Oded Berman, Rongbing Huang:
The minimum weighted covering location problem with distance constraints. Comput. Oper. Res. 35(2): 356-372 (2008) - [j110]Oded Berman, Qian Wang:
Locating a semi-obnoxious facility with expropriation. Comput. Oper. Res. 35(2): 392-403 (2008) - [j109]Oded Berman, Zvi Drezner:
The p-median problem under uncertainty. Eur. J. Oper. Res. 189(1): 19-30 (2008) - [j108]Oded Berman, Zvi Drezner, George O. Wesolowsky:
The multiple location of transfer points. J. Oper. Res. Soc. 59(6): 805-811 (2008) - [j107]Oded Berman, J. Wang:
The probabilistic 1-maximal covering problem on a network with discrete demand weights. J. Oper. Res. Soc. 59(10): 1398-1405 (2008) - [j106]Robert Aboolian
Optimizing pricing and location decisions for competitive service facilities charging uniform price. J. Oper. Res. Soc. 59(11): 1506-1519 (2008) - [j105]Opher Baron
Facility Location with Stochastic Demand and Constraints on Waiting Time. Manuf. Serv. Oper. Manag. 10(3): 484-505 (2008) - [j104]Oded Berman, Zvi Drezner:
A new formulation for the conditional p-median and p-center problems. Oper. Res. Lett. 36(4): 481-483 (2008) - 2007
- [j103]Oded Berman, Vedat Verter, Bahar Yetis Kara:
Designing emergency response networks for hazardous materials transportation. Comput. Oper. Res. 34(5): 1374-1388 (2007) - [j102]Rajan Batta, Oded Berman, Qian Wang:
Balancing staffing and switching costs in a service center with flexible servers. Eur. J. Oper. Res. 177(2): 924-938 (2007) - [j101]Oded Berman, Arieh Gavious:
Location of terror response facilities: A game between state and terrorist. Eur. J. Oper. Res. 177(2): 1113-1133 (2007) - [j100]Igor Averbakh, Oded Berman, Zvi Drezner, George O. Wesolowsky:
The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation. Eur. J. Oper. Res. 179(3): 956-967 (2007) - [j99]Oded Berman, Zvi Drezner, George O. Wesolowsky:
The transfer point location problem. Eur. J. Oper. Res. 179(3): 978-989 (2007) - [j98]Robert Aboolian
Competitive facility location model with concave demand. Eur. J. Oper. Res. 181(2): 598-619 (2007) - [j97]Robert Aboolian
Competitive facility location and design problem. Eur. J. Oper. Res. 182(1): 40-62 (2007) - [j96]Opher Baron
The equitable location problem on the plane. Eur. J. Oper. Res. 183(2): 578-590 (2007) - [j95]Oded Berman, Dmitry Krass, Mozart B. C. Menezes
Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects. Oper. Res. 55(2): 332-350 (2007) - [j94]Oded Berman, Zvi Drezner:
The multiple server location problem. J. Oper. Res. Soc. 58(1): 91-99 (2007) - [j93]Oded Berman, Q. Wang:
Locating semi-obnoxious facilities with expropriation: minisum criterion. J. Oper. Res. Soc. 58(3): 378-390 (2007) - [j92]Oded Berman:
Reply to Özpeynirci and Süral. J. Oper. Res. Soc. 58(10): 1396 (2007) - [j91]Oded Berman, Jiamin Wang:
The 1-minimax and 1-maximin problems with demand weights of general probability distributions. Networks 50(2): 127-135 (2007) - [j90]Oded Berman, Rongbing Huang:
The Minisum Multipurpose Trip Location Problem on Networks. Transp. Sci. 41(4): 500-515 (2007) - 2006
- [j89]Oded Berman, David Perry:
An EOQ model with state-dependent demand rate. Eur. J. Oper. Res. 171(1): 255-272 (2006) - [j88]Igor Averbakh, Oded Berman, Ilya Chernykh
The routing open-shop problem on a network: Complexity and approximation. Eur. J. Oper. Res. 173(2): 531-539 (2006) - [j87]Oded Berman, Qian Wang:
Inbound Logistic Planning: Minimizing Transportation and Inventory Cost. Transp. Sci. 40(3): 287-299 (2006) - 2005
- [j86]Oded Berman, Dmitry Krass:
An Improved IP Formulation for the Uncapacitated Facility Location Problem: Capitalizing on Objective Function Structure. Ann. Oper. Res. 136(1): 21-34 (2005) - [j85]Igor Averbakh, Oded Berman, Ilya Chernykh
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network. Eur. J. Oper. Res. 166(1): 3-24 (2005) - [j84]Oded Berman, Jiamin Wang, K. P. Sapna
Optimal management of cross-trained workers in services with negligible switching costs. Eur. J. Oper. Res. 167(2): 349-369 (2005) - [j83]Oded Berman, Zvi Drezner, George O. Wesolowsky:
The facility and transfer points location problem. Int. Trans. Oper. Res. 12(4): 387-402 (2005) - [j82]Igor Averbakh, Oded Berman, Ilya Chernykh
The m-machine flowshop problem with unit-time operations and intree precedence constraints. Oper. Res. Lett. 33(3): 263-266 (2005) - [j81]Oded Berman, Sandeep Vasudeva:
Approximating performance measures for public services. IEEE Trans. Syst. Man Cybern. Part A 35(4): 583-591 (2005) - 2004
- [j80]Oded Berman, Richard C. Larson:
A queueing control model for retail services having back room operations and cross-trained workers. Comput. Oper. Res. 31(2): 201-222 (2004) - [j79]Oded Berman, Michal Cutler:
Resource allocation during tests for optimally reliable software. Comput. Oper. Res. 31(11): 1847-1865 (2004) - [j78]Oded Berman, R. Huang:
Minisum collection depots location problem with multiple facilities on a network. J. Oper. Res. Soc. 55(7): 769-779 (2004) - [j77]Oded Berman, Eungab Kim:
Dynamic inventory strategies for profit maximization in a service facility with stochastic service, demand and lead time. Math. Methods Oper. Res. 60(3): 497-521 (2004) - [j76]Oded Berman, Jiamin Wang:
Probabilistic location problems with discrete demand weights. Networks 44(1): 47-57 (2004) - 2003
- [j75]Oded Berman, Jiamin Wang, Zvi Drezner, George O. Wesolowsky:
A Probabilistic Minimax Location Problem on the Plane. Ann. Oper. Res. 122(1-4): 59-70 (2003) - [j74]Oded Berman, Zvi Drezner, George O. Wesolowsky:
Locating service facilities whose reliability is distance dependent. Comput. Oper. Res. 30(11): 1683-1695 (2003) - [j73]Oded Berman, Dmitry Krass, Zvi Drezner:
The gradual covering decay location problem on a network. Eur. J. Oper. Res. 151(3): 474-480 (2003) - [j72]Oded Berman, Zvi Drezner, George O. Wesolowsky:
The expropriation location problem. J. Oper. Res. Soc. 54(7): 769-776 (2003) - [j71]Oded Berman, Zvi Drezner:
A probabilistic one-centre location problem on a network. J. Oper. Res. Soc. 54(8): 871-877 (2003) - [j70]Oded Berman, Dmitry Krass, David Perry:
A transfer/clearing inventory model under sporadic review. Math. Methods Oper. Res. 57(2): 329-344 (2003) - [j69]Igor Averbakh, Oded Berman:
An improved algorithm for the minmax regret median problem on a tree. Networks 41(2): 97-103 (2003) - 2002
- [j68]Oded Berman, Dmitry Krass:
Recent Developments in the Theory and Applications of Location Models: A Preview. Ann. Oper. Res. 110(1-4): 15-16 (2002) - [j67]Igor Averbakh, Oded Berman:
Minmax p-Traveling Salesmen Location Problems on a Tree. Ann. Oper. Res. 110(1-4): 55-68 (2002) - [j66]Oded Berman, Dmitry Krass:
Recent Developments in the Theory and Applications of Location Models: A Preview. Ann. Oper. Res. 111(1-4): 15-16 (2002) - [j65]Oded Berman, Dmitry Krass:
Locating Multiple Competitive Facilities: Spatial Interaction Models with Variable Expenditures. Ann. Oper. Res. 111(1-4): 197-225 (2002) - [j64]Oded Berman, Dmitry Krass:
The generalized maximal covering location problem. Comput. Oper. Res. 29(6): 563-581 (2002) - [j63]Igor Averbakh, Oded Berman:
Parallel NC-algorithms for multifacility location problems with mutual communication and their applications. Networks 40(1): 1-12 (2002) - 2001
- [j62]Oded Berman, K. P. Sapna
Optimal control of service for facilities holding inventory. Comput. Oper. Res. 28(5): 429-441 (2001) - [j61]Oded Berman, Eungab Kim:
Dynamic order replenishment policy in internet-based supply chains. Math. Methods Oper. Res. 53(3): 371-390 (2001) - [j60]Oded Berman, Richard C. Larson:
Deliveries in an Inventory/Routing Problem Using Stochastic Dynamic Programming. Transp. Sci. 35(2): 192-213 (2001) - [j59]Oded Berman, Fatemeh Mariam Zahedi, Kim R. Pemble:
A decision model and support system for the optimal design of health information networks. IEEE Trans. Syst. Man Cybern. Syst. 31(2): 146-158 (2001) - 2000
- [j58]Oded Berman, Zvi Drezner:
A note on the location of an obnoxious facility on a network. Eur. J. Oper. Res. 120(1): 215-217 (2000) - [j57]Igor Averbakh, Oded Berman:
Algorithms for the robust 1-center problem on a tree. Eur. J. Oper. Res. 123(2): 292-302 (2000) - [j56]Igor Averbakh, Oded Berman:
Minmax Regret Median Location on a Network Under Uncertainty. INFORMS J. Comput. 12(2): 104-110 (2000) - [j55]Oded Berman, Zvi Drezner, George O. Wesolowsky:
Routing and location on a network with hazardous threats. J. Oper. Res. Soc. 51(9): 1093-1099 (2000)
1990 – 1999
- 1999
- [j54]Oded Berman, U. Dinesh Kumar:
Optimization models for complex recovery block schemes. Comput. Oper. Res. 26(5): 525-544 (1999) - [j53]Igor Averbakh, Oded Berman:
Algorithms for path medi-centers of a tree. Comput. Oper. Res. 26(14): 1395-1409 (1999) - [j52]Oded Berman, U. Dinesh Kumar:
Optimization models for recovery block schemes. Eur. J. Oper. Res. 115(2): 368-379 (1999) - [j51]Igor Averbakh, Oded Berman:
Parallel Complexity of Additive Location Problems. INFORMS J. Comput. 11(3): 292-298 (1999) - [j50]Igor Averbakh, Oded Berman:
A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems. Oper. Res. 47(1): 165-170 (1999) - 1998
- [j49]Oded Berman, Michal Cutler:
Optimal software implementation considering reliability and cost. Comput. Oper. Res. 25(10): 857-868 (1998) - [j48]Igor Averbakh, Oded Berman, Zvi Drezner, George O. Wesolowsky:
The plant location problem with demand-dependent setup costs and centralized allocation. Eur. J. Oper. Res. 111(3): 543-554 (1998) - [j47]Igor Averbakh, Oded Berman:
Location problems with grouped structure of demand: Complexity and algorithms. Networks 31(2): 81-92 (1998) - 1997
- [j46]Igor Averbakh, Oded Berman:
(p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective. Discret. Appl. Math. 75(3): 201-216 (1997) - 1996
- [j45]Igor Averbakh, Oded Berman:
A Heuristic with Worst-case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree. Discret. Appl. Math. 68(1-2): 17-32 (1996) - [j44]Igor Averbakh, Oded Berman:
Bottleneck Steiner Subnetwork Problems with k-Connectivity Constraints. INFORMS J. Comput. 8(4): 361-366 (1996) - [j43]Oded Berman, Zvi Drezner, George O. Wesolowsky:
Minimum covering criterion for obnoxious facility location on a network. Networks 28(1): 1-5 (1996) - [j42]Oded Berman, Michal Cutler:
Choosing an optimal set of libraries [software reliability]. IEEE Trans. Reliab. 45(2): 303-307 (1996) - [j41]Igor Averbakh, Oded Berman:
Technical Note - A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree. Transp. Sci. 30(3): 261-269 (1996) - [j40]Igor Averbakh, Oded Berman:
Routing Two-Machine Flowshop Problems on Networks with Special Structure. Transp. Sci. 30(4): 303-314 (1996) - 1995
- [j39]Janet M. Wagner, Oded Berman:
Models for planning capacity expansion of convenience stores under uncertain demand and the value of information. Ann. Oper. Res. 59(1): 19-44 (1995) - [j38]Oded Berman, Dmitry Krass, Chen Wei Xu:
Locating flow-intercepting facilities: New approaches and results. Ann. Oper. Res. 60(1): 121-143 (1995) - [j37]Igor Averbakh, Oded Berman, Abraham P. Punnen:
Constrained Matroidal Bottleneck Problems. Discret. Appl. Math. 63(3): 201-214 (1995) - [j36]Oded Berman, Dimitris Bertsimas, Richard C. Larson:
Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience. Oper. Res. 43(4): 623-632 (1995) - [j35]Igor Averbakh, Oded Berman:
Sales-delivery man problems on treelike networks. Networks 25(2): 45-58 (1995) - [j34]Igor Averbakh, Oded Berman:
Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree. Transp. Sci. 29(2): 184-197 (1995) - [j33]Oded Berman, Dmitry Krass, Chen Wei Xu:
Locating Discretionary Service Facilities Based on Probabilistic Customer Flows. Transp. Sci. 29(3): 276-290 (1995) - 1994
- [j32]Oded Berman, Divinagracia I. Ingco, Amedeo R. Odoni:
Improving the location of minimax facilities through network modification. Networks 24(1): 31-41 (1994) - [j31]Igor Averbakh, Oded Berman:
Categorized bottleneck-minisum path problems on networks. Oper. Res. Lett. 16(5): 291-297 (1994) - [j30]Igor Averbakh, Oded Berman:
Technical Note - Routing and Location-Routing p-Delivery Men Problems on a Path. Transp. Sci. 28(2): 162-166 (1994) - 1993
- [j29]Oded Berman, Noushin Ashrafi:
Optimization Models for Reliability of Modular Software Systems. IEEE Trans. Software Eng. 19(11): 1119-1123 (1993) - 1992
- [j28]Oded Berman, Divinagracia I. Ingco, Amedeo R. Odoni:
Improving the location of minisum facilities through network modification. Ann. Oper. Res. 40(1): 1-16 (1992) - [j27]Oded Berman, Richard C. Larson, Nikoletta Fouska:
Optimal Location of Discretionary Service Facilities. Transp. Sci. 26(3): 201-211 (1992) - 1990
- [j26]Oded Berman, D. Einav, Gabriel Y. Handler:
The Constrained Bottleneck Problem in Networks. Oper. Res. 38(1): 178-181 (1990) - [j25]David Simchi-Levi, Oded Berman:
Optimal locations and districts of two traveling salesmen on a tree. Networks 20(7): 803-815 (1990) - [j24]Oded Berman, David Simchi-Levi:
Technical Note - Conditional Location Problems on Networks. Transp. Sci. 24(1): 77-78 (1990) - [j23]Oded Berman, Edward H. Kaplan:
Equity Maximizing Facility Location Schemes. Transp. Sci. 24(2): 137-144 (1990) - [j22]Oded Berman:
Mean-Variance Location Problems. Transp. Sci. 24(4): 287-293 (1990) - [j21]Oded Berman, Mina Rasty Rahnama:
Information/communication and dispatching strategies for networks with mobile servers. IEEE Trans. Syst. Man Cybern. 20(1): 111-118 (1990)
1980 – 1989
- 1989
- [j20]Rajan Batta, Oded Berman:
A location model for a facility operating as an M/G/k queue. Networks 19(6): 717-728 (1989) - [j19]Oded Berman, David Simchi-Levi:
The Traveling Salesman Location Problem on Stochastic Networks. Transp. Sci. 23(1): 54-57 (1989) - 1988
- [j18]David Simchi-Levi, Oded Berman:
A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks. Oper. Res. 36(3): 478-484 (1988) - [j17]Oded Berman, David Simchi-Levi, Arie Tamir:
The minimax multistop location problem on a tree. Networks 18(1): 39-49 (1988) - [j16]Oded Berman, David Simchi-Levi:
Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers. Transp. Sci. 22(2): 148-154 (1988) - 1987
- [j15]Oded Berman, Gabriel Y. Handler:
Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations. Transp. Sci. 21(2): 115-122 (1987) - [j14]Oded Berman, Richard C. Larson, Cekil Parkan:
The Stochastic Queue p-Median Problem. Transp. Sci. 21(3): 207-216 (1987) - 1986
- [j13]Oded Berman, David Simchi-Levi:
Minisum location of a traveling salesman. Networks 16(3): 239-254 (1986) - [j12]Oded Berman, Oded Maimon:
Cooperation among flexible manufacturing systems. IEEE J. Robotics Autom. 2(1): 24-30 (1986) - 1985
- [j11]Zvi Adar, Niv Ahituv, Oded Berman:
The value of an information system for service networks. Comput. Oper. Res. 12(1): 71-85 (1985) - [j10]Oded Berman, Richard C. Larson, Samuel S. Chiu:
Optimal Server Location on a Network Operating as an M/G/1 Queue. Oper. Res. 33(4): 746-771 (1985) - [j9]Oded Berman:
Locating a facility on a congested network with random lengths. Networks 15(3): 275-293 (1985) - [j8]Oded Berman, Mina Rasty Rahnama:
Optimal Location-Relocation Decisions on Stochastic Networks. Transp. Sci. 19(3): 203-221 (1985) - [j7]Oded Berman, Richard C. Larson:
Optimal 2-Facility Network Districting in the Presence of Queuing. Transp. Sci. 19(3): 261-277 (1985) - 1984
- [j6]Oded Berman, B. LeBlanc:
Location-Relocation of Mobile Facilities on a Stochastic Network. Transp. Sci. 18(4): 315-330 (1984) - 1983
- [j5]Oded Berman, Mina Rasty Rahnama:
A procedure for dispatching moving mobile servers. Networks 13(1): 121-141 (1983) - 1982
- [j4]Oded Berman, Richard C. Larson:
The median problem with congestion. Comput. Oper. Res. 9(2): 119-126 (1982) - [j3]Oded Berman, Amedeo R. Odoni:
Locating mobile servers on a network with markovian properties. Networks 12(1): 73-86 (1982) - 1981
- [j2]Oded Berman:
Repositioning of distinguishable urban service units on networks. Comput. Oper. Res. 8(2): 105-118 (1981) - [j1]Oded Berman:
Repositioning of Two Distinguishable Service Vehicles on Networks. IEEE Trans. Syst. Man Cybern. 11(3): 187-193 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: