Oded Berman

According to our database, Oded Berman authored at least 161 papers between 1981 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Re-direction in queueing networks with two customer types: The inter-departure analysis.

Opher Baron, Oded Berman, Dmitry Krass, Eliran Sherzer

Comput. Oper. Res., 2025

2022

Probabilistic Set Covering Location Problem in Congested Networks.

Robert Aboolian, Oded Berman, Majid Karimi

Transp. Sci., 2022

The multifacility center problems with random demand weights.

Oded Berman, Jiamin Wang

Networks, 2022

Introducing Autonomous Vehicles: Adoption Patterns and Impacts on Social Welfare.

Opher Baron, Oded Berman, Mehdi Nourinejad

Manuf. Serv. Oper. Manag., 2022

2021

Optimizing facility location and design.

Robert Aboolian, Oded Berman, Dmitry Krass

Eur. J. Oper. Res., 2021

Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams.

Igor Averbakh, Oded Berman, Jörg Kalcsics, Dmitry Krass

Discret. Appl. Math., 2021

2019

Tandem queues with impatient customers.

Jianfu Wang, Hossein Abouee-Mehrizi, Opher Baron, Oded Berman

Perform. Evaluation, 2019

Truthful Cheap Talk: Why Operational Flexibility May Lead to Truthful Communication.

Oded Berman, Mohammad M. Fazel-Zarandi, Dmitry Krass

Manag. Sci., 2019

The multiple gradual cover location problem.

Oded Berman, Zvi Drezner, Dmitry Krass

J. Oper. Res. Soc., 2019

Almost Robust Discrete Optimization.

Opher Baron, Oded Berman, Mohammad M. Fazel-Zarandi, Vahid Roshanaei

Eur. J. Oper. Res., 2019

2018

Threshold-Based Allocation Policies for Inventory Management of Red Blood Cells.

Vahid Sarhangian, Hossein Abouee-Mehrizi, Opher Baron, Oded Berman

Manuf. Serv. Oper. Manag., 2018

Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights.

Igor Averbakh, Oded Berman, Marina Leal

Discret. Appl. Math., 2018

Location and Capacity Planning of Facilities with General Service-Time Distributions Using Conic Optimization.

Amir Ahmadi-Javid, Oded Berman, Pooya Hoseinpour

CoRR, 2018

2017

Exact analysis of the (R, Q) inventory policy in a two-echelon production-inventory system.

Ata G. Zare, Hossein Abouee-Mehrizi, Oded Berman

Oper. Res. Lett., 2017

Strategic Idleness and Dynamic Scheduling in an Open-Shop Service Network: Case Study and Analysis.

Opher Baron, Oded Berman, Dmitry Krass, Jianfu Wang

Manuf. Serv. Oper. Manag., 2017

2016

Maximal Accessibility Network Design in the Public Sector.

Robert Aboolian, Oded Berman, Vedat Verter

Transp. Sci., 2016

Bargaining within the Supply Chain and Its Implications in an Industry.

Opher Baron, Oded Berman, Desheng Wu

Decis. Sci., 2016

On covering location problems on networks with edge demand.

Oded Berman, Jörg Kalcsics, Dmitry Krass

Comput. Oper. Res., 2016

2015

Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand.

Igor Averbakh, Oded Berman, Jörg Kalcsics, Dmitry Krass

Oper. Res., 2015

Optimal Joint Replenishment and Transshipment Policies in a Multi-Period Inventory System with Lost Sales.

Hossein Abouee-Mehrizi, Oded Berman, Shrutivandana Sharma

Oper. Res., 2015

2014

Designing Production-Inventory-Transportation Systems with Capacitated Cross-Docks.

Hossein Abouee-Mehrizi, Oded Berman, M. Reza Baharnemati

Transp. Sci., 2014

Cooperative covering problems on networks.

Igor Averbakh, Oded Berman, Dmitry Krass, Jörg Kalcsics, Stefan Nickel

Networks, 2014

Minisum multipurpose trip location problem on trees.

Mojtaba Araghi, Oded Berman, Igor Averbakh

Networks, 2014

Exact Analysis of Capacitated Two-Echelon Inventory Systems with Priorities.

Hossein Abouee-Mehrizi, Opher Baron, Oded Berman

Manuf. Serv. Oper. Manag., 2014

Using Strategic Idleness to Improve Customer Service Experience in Service Networks.

Opher Baron, Oded Berman, Dmitry Krass, Jianfu Wang

Oper. Res., 2014

Supporting New Product or Service Introductions: Location, Marketing, and Word of Mouth.

Vahideh Sadat Abedi, Oded Berman, Dmitry Krass

Oper. Res., 2014

2013

Continuous covering and cooperative covering problems with a general decay function on networks.

Oded Berman, Zvi Drezner, Dmitry Krass

J. Oper. Res. Soc., 2013

2012

Profit Maximizing Distributed Service System Design with Congestion and Elastic Demand.

Robert Aboolian, Oded Berman, Dmitry Krass

Transp. Sci., 2012

The impact of client choice on preventive healthcare facility network design.

Yue Zhang, Oded Berman, Vedat Verter

OR Spectr., 2012

A coordinated location-inventory model.

Oded Berman, Dmitry Krass, M. Mahdi Tajbakhsh

Eur. J. Oper. Res., 2012

Optimal response against bioterror attack on airport terminal.

Oded Berman, Arieh Gavious, Mozart B. C. Menezes

Eur. J. Oper. Res., 2012

Do Shareholders Really Prefer Their Executives to Maximize the Equity Value? A Newsvendor Case.

Oded Berman, Nima Sanajian, Hossein Abouee-Mehrizi

Decis. Sci., 2012

2011

Big segment small segment global optimization algorithm on networks.

Oded Berman, Zvi Drezner, Dmitry Krass

Networks, 2011

Optimizing capacity, pricing and location decisions on a congested network with balking.

Hossein Abouee-Mehrizi, Sahar Babri, Oded Berman, Hassan Shavandi

Math. Methods Oper. Res., 2011

Discrete cooperative covering problems.

Oded Berman, Zvi Drezner, Dmitry Krass

J. Oper. Res. Soc., 2011

The minmax regret gradual covering location problem on a network with incomplete information of demand weights.

Oded Berman, Jiamin Wang

Eur. J. Oper. Res., 2011

On n-facility median problem with facilities subject to failure facing uniform demand.

Oded Berman, Dmitry Krass

Discret. Appl. Math., 2011

The probabilistic gradual covering location problem on a network with discrete random demand weights.

Oded Berman, Dmitry Krass, Jiamin Wang

Comput. Oper. Res., 2011

Optimal search path for service in the presence of disruptions.

Oded Berman, Eduard Ianovsky, Dmitry Krass

Comput. Oper. Res., 2011

2010

Continuous review inventory models for perishable items ordered in batches.

Opher Baron, Oded Berman, David Perry

Math. Methods Oper. Res., 2010

The network p-median problem with discrete probabilistic demand weights.

Oded Berman, Jiamin Wang

Comput. Oper. Res., 2010

Generalized coverage: New developments in covering location models.

Oded Berman, Zvi Drezner, Dmitry Krass

Comput. Oper. Res., 2010

2009

A defensive maximal covering problem on a network.

Oded Berman, Tammy Drezner, Zvi Drezner, George O. Wesolowsky

Int. Trans. Oper. Res., 2009

Incorporating congestion in preventive healthcare facility network design.

Yue Zhang, Oded Berman, Vedat Verter

Eur. J. Oper. Res., 2009

Bargaining in competing supply chains with uncertainty.

Desheng Wu, Opher Baron, Oded Berman

Eur. J. Oper. Res., 2009

The variable radius covering problem.

Oded Berman, Zvi Drezner, Dmitry Krass, George O. Wesolowsky

Eur. J. Oper. Res., 2009

Locating Facilities in the Presence of Disruptions and Incomplete Information.

Oded Berman, Dmitry Krass, Mozart B. C. Menezes

Decis. Sci., 2009

The Ordered Gradual Covering Location Problem on a Network.

Oded Berman, Jörg Kalcsics, Dmitry Krass, Stefan Nickel

Discret. Appl. Math., 2009

Optimal location with equitable loads.

Oded Berman, Zvi Drezner, Arie Tamir, George O. Wesolowsky

Ann. Oper. Res., 2009

Efficient solution approaches for a discrete multi-facility competitive interaction model.

Robert Aboolian, Oded Berman, Dmitry Krass

Ann. Oper. Res., 2009

The multiple server center location problem.

Robert Aboolian, Oded Berman, Zvi Drezner

Ann. Oper. Res., 2009

2008

A new formulation for the conditional p-median and p-center problems.

Oded Berman, Zvi Drezner

Oper. Res. Lett., 2008

Facility Location with Stochastic Demand and Constraints on Waiting Time.

Opher Baron, Oded Berman, Dmitry Krass

Manuf. Serv. Oper. Manag., 2008

The probabilistic 1-maximal covering problem on a network with discrete demand weights.

Oded Berman, J. Wang

J. Oper. Res. Soc., 2008

The multiple location of transfer points.

Oded Berman, Zvi Drezner, George O. Wesolowsky

J. Oper. Res. Soc., 2008

Optimizing pricing and location decisions for competitive service facilities charging uniform price.

Robert Aboolian, Oded Berman, Dmitry Krass

J. Oper. Res. Soc., 2008

The p-median problem under uncertainty.

Oded Berman, Zvi Drezner

Eur. J. Oper. Res., 2008

Locating a semi-obnoxious facility with expropriation.

Oded Berman, Qian Wang

Comput. Oper. Res., 2008

The minimum weighted covering location problem with distance constraints.

Oded Berman, Rongbing Huang

Comput. Oper. Res., 2008

2007

The Minisum Multipurpose Trip Location Problem on Networks.

Oded Berman, Rongbing Huang

Transp. Sci., 2007

The 1-minimax and 1-maximin problems with demand weights of general probability distributions.

Oded Berman, Jiamin Wang

Networks, 2007

Locating semi-obnoxious facilities with expropriation: minisum criterion.

Oded Berman, Q. Wang

J. Oper. Res. Soc., 2007

The multiple server location problem.

Oded Berman, Zvi Drezner

J. Oper. Res. Soc., 2007

Reply to Özpeynirci and Süral.

Oded Berman

J. Oper. Res. Soc., 2007

Facility Reliability Issues in Network <i>p</i>-Median Problems: Strategic Centralization and Co-Location Effects.

Oded Berman, Dmitry Krass, Mozart B. C. Menezes

Oper. Res., 2007

Location of terror response facilities: A game between state and terrorist.

Oded Berman, Arieh Gavious

Eur. J. Oper. Res., 2007

The transfer point location problem.

Oded Berman, Zvi Drezner, George O. Wesolowsky

Eur. J. Oper. Res., 2007

Balancing staffing and switching costs in a service center with flexible servers.

Rajan Batta, Oded Berman, Qian Wang

Eur. J. Oper. Res., 2007

The equitable location problem on the plane.

Opher Baron, Oded Berman, Dmitry Krass, Qian Wang

Eur. J. Oper. Res., 2007

The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation.

Igor Averbakh, Oded Berman, Zvi Drezner, George O. Wesolowsky

Eur. J. Oper. Res., 2007

Competitive facility location and design problem.

Robert Aboolian, Oded Berman, Dmitry Krass

Eur. J. Oper. Res., 2007

Competitive facility location model with concave demand.

Robert Aboolian, Oded Berman, Dmitry Krass

Eur. J. Oper. Res., 2007

Designing emergency response networks for hazardous materials transportation.

Oded Berman, Vedat Verter, Bahar Yetis Kara

Comput. Oper. Res., 2007

2006

Inbound Logistic Planning: Minimizing Transportation and Inventory Cost.

Oded Berman, Qian Wang

Transp. Sci., 2006

An EOQ model with state-dependent demand rate.

Oded Berman, David Perry

Eur. J. Oper. Res., 2006

The routing open-shop problem on a network: Complexity and approximation.

Igor Averbakh, Oded Berman, Ilya Chernykh

Eur. J. Oper. Res., 2006

2005

Approximating performance measures for public services.

Oded Berman, Sandeep Vasudeva

IEEE Trans. Syst. Man Cybern. Part A, 2005

The <i>m</i>-machine flowshop problem with unit-time operations and intree precedence constraints.

Igor Averbakh, Oded Berman, Ilya Chernykh

Oper. Res. Lett., 2005

The facility and transfer points location problem.

Oded Berman, Zvi Drezner, George O. Wesolowsky

Int. Trans. Oper. Res., 2005

Optimal management of cross-trained workers in services with negligible switching costs.

Oded Berman, Jiamin Wang, K. P. Sapna

Eur. J. Oper. Res., 2005

A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network.

Igor Averbakh, Oded Berman, Ilya Chernykh

Eur. J. Oper. Res., 2005

An Improved IP Formulation for the Uncapacitated Facility Location Problem: Capitalizing on Objective Function Structure.

Oded Berman, Dmitry Krass

Ann. Oper. Res., 2005

2004

Probabilistic location problems with discrete demand weights.

Oded Berman, Jiamin Wang

Networks, 2004

Dynamic inventory strategies for profit maximization in a service facility with stochastic service, demand and lead time.

Oded Berman, Eungab Kim

Math. Methods Oper. Res., 2004

Minisum collection depots location problem with multiple facilities on a network.

Oded Berman, R. Huang

J. Oper. Res. Soc., 2004

A queueing control model for retail services having back room operations and cross-trained workers.

Oded Berman, Richard C. Larson

Comput. Oper. Res., 2004

Resource allocation during tests for optimally reliable software.

Oded Berman, Michal Cutler

Comput. Oper. Res., 2004

2003

An improved algorithm for the minmax regret median problem on a tree.

Igor Averbakh, Oded Berman

Networks, 2003

A transfer/clearing inventory model under sporadic review.

Oded Berman, Dmitry Krass, David Perry

Math. Methods Oper. Res., 2003

The expropriation location problem.

Oded Berman, Zvi Drezner, George O. Wesolowsky

J. Oper. Res. Soc., 2003

A probabilistic one-centre location problem on a network.

Oded Berman, Zvi Drezner

J. Oper. Res. Soc., 2003

The gradual covering decay location problem on a network.

Oded Berman, Dmitry Krass, Zvi Drezner

Eur. J. Oper. Res., 2003

Locating service facilities whose reliability is distance dependent.

Oded Berman, Zvi Drezner, George O. Wesolowsky

Comput. Oper. Res., 2003

A Probabilistic Minimax Location Problem on the Plane.

Oded Berman, Jiamin Wang, Zvi Drezner, George O. Wesolowsky

Ann. Oper. Res., 2003

2002

Parallel NC-algorithms for multifacility location problems with mutual communication and their applications.

Igor Averbakh, Oded Berman

Networks, 2002

The generalized maximal covering location problem.

Oded Berman, Dmitry Krass

Comput. Oper. Res., 2002

Locating Multiple Competitive Facilities: Spatial Interaction Models with Variable Expenditures.

Oded Berman, Dmitry Krass

Ann. Oper. Res., 2002

Recent Developments in the Theory and Applications of Location Models: A Preview.

Oded Berman, Dmitry Krass

Ann. Oper. Res., 2002

Minmax <i>p</i>-Traveling Salesmen Location Problems on a Tree.

Igor Averbakh, Oded Berman

Ann. Oper. Res., 2002

2001

A decision model and support system for the optimal design of health information networks.

Oded Berman, Fatemeh Mariam Zahedi, Kim R. Pemble

IEEE Trans. Syst. Man Cybern. Syst., 2001

Deliveries in an Inventory/Routing Problem Using Stochastic Dynamic Programming.

Oded Berman, Richard C. Larson

Transp. Sci., 2001

Dynamic order replenishment policy in internet-based supply chains.

Oded Berman, Eungab Kim

Math. Methods Oper. Res., 2001

Optimal control of service for facilities holding inventory.

Oded Berman, K. P. Sapna

Comput. Oper. Res., 2001

2000

Routing and location on a network with hazardous threats.

Oded Berman, Zvi Drezner, George O. Wesolowsky

J. Oper. Res. Soc., 2000

Minmax Regret Median Location on a Network Under Uncertainty.

Igor Averbakh, Oded Berman

INFORMS J. Comput., 2000

A note on the location of an obnoxious facility on a network.

Oded Berman, Zvi Drezner

Eur. J. Oper. Res., 2000

Algorithms for the robust 1-center problem on a tree.

Igor Averbakh, Oded Berman

Eur. J. Oper. Res., 2000

1999

A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems.

Igor Averbakh, Oded Berman

Oper. Res., 1999

Parallel Complexity of Additive Location Problems.

Igor Averbakh, Oded Berman

INFORMS J. Comput., 1999

Optimization models for recovery block schemes.

Oded Berman, U. Dinesh Kumar

Eur. J. Oper. Res., 1999

Optimization models for complex recovery block schemes.

Oded Berman, U. Dinesh Kumar

Comput. Oper. Res., 1999

Algorithms for path medi-centers of a tree.

Igor Averbakh, Oded Berman

Comput. Oper. Res., 1999

1998

Location problems with grouped structure of demand: Complexity and algorithms.

Igor Averbakh, Oded Berman

Networks, 1998

The plant location problem with demand-dependent setup costs and centralized allocation.

Igor Averbakh, Oded Berman, Zvi Drezner, George O. Wesolowsky

Eur. J. Oper. Res., 1998

Optimal software implementation considering reliability and cost.

Oded Berman, Michal Cutler

Comput. Oper. Res., 1998

1997

(p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective.

Igor Averbakh, Oded Berman

Discret. Appl. Math., 1997

1996

Routing Two-Machine Flowshop Problems on Networks with Special Structure.

Igor Averbakh, Oded Berman

Transp. Sci., 1996

Technical Note - A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree.

Igor Averbakh, Oded Berman

Transp. Sci., 1996

Choosing an optimal set of libraries [software reliability].

Oded Berman, Michal Cutler

IEEE Trans. Reliab., 1996

Minimum covering criterion for obnoxious facility location on a network.

Oded Berman, Zvi Drezner, George O. Wesolowsky

Networks, 1996

Bottleneck Steiner Subnetwork Problems with <i>k</i>-Connectivity Constraints.

Igor Averbakh, Oded Berman

INFORMS J. Comput., 1996

A Heuristic with Worst-case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree.

Igor Averbakh, Oded Berman

Discret. Appl. Math., 1996

1995

Locating Discretionary Service Facilities Based on Probabilistic Customer Flows.

Oded Berman, Dmitry Krass, Chen Wei Xu

Transp. Sci., 1995

Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree.

Igor Averbakh, Oded Berman

Transp. Sci., 1995

Sales-delivery man problems on treelike networks.

Igor Averbakh, Oded Berman

Networks, 1995

Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience.

Oded Berman, Dimitris Bertsimas, Richard C. Larson

Oper. Res., 1995

Constrained Matroidal Bottleneck Problems.

Igor Averbakh, Oded Berman, Abraham P. Punnen

Discret. Appl. Math., 1995

Models for planning capacity expansion of convenience stores under uncertain demand and the value of information.

Janet M. Wagner, Oded Berman

Ann. Oper. Res., 1995

Locating flow-intercepting facilities: New approaches and results.

Oded Berman, Dmitry Krass, Chen Wei Xu

Ann. Oper. Res., 1995

1994

Technical Note - Routing and Location-Routing p-Delivery Men Problems on a Path.

Igor Averbakh, Oded Berman

Transp. Sci., 1994

Categorized bottleneck-minisum path problems on networks.

Igor Averbakh, Oded Berman

Oper. Res. Lett., 1994

Improving the location of minimax facilities through network modification.

Oded Berman, Divinagracia I. Ingco, Amedeo R. Odoni

Networks, 1994

1993

Optimization Models for Reliability of Modular Software Systems.

Oded Berman, Noushin Ashrafi

IEEE Trans. Software Eng., 1993

1992

Optimal Location of Discretionary Service Facilities.

Oded Berman, Richard C. Larson, Nikoletta Fouska

Transp. Sci., 1992

Improving the location of minisum facilities through network modification.

Oded Berman, Divinagracia I. Ingco, Amedeo R. Odoni

Ann. Oper. Res., 1992

1990

Information/communication and dispatching strategies for networks with mobile servers.

Oded Berman, Mina Rasty Rahnama

IEEE Trans. Syst. Man Cybern., 1990

Technical Note - Conditional Location Problems on Networks.

Oded Berman, David Simchi-Levi

Transp. Sci., 1990

Equity Maximizing Facility Location Schemes.

Oded Berman, Edward H. Kaplan

Transp. Sci., 1990

Mean-Variance Location Problems.

Oded Berman

Transp. Sci., 1990

Optimal locations and districts of two traveling salesmen on a tree.

David Simchi-Levi, Oded Berman

Networks, 1990

The Constrained Bottleneck Problem in Networks.

Oded Berman, D. Einav, Gabriel Y. Handler

Oper. Res., 1990

1989

The Traveling Salesman Location Problem on Stochastic Networks.

Oded Berman, David Simchi-Levi

Transp. Sci., 1989

A location model for a facility operating as an <i>M/G/k</i> queue.

Rajan Batta, Oded Berman

Networks, 1989

1988

Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers.

Oded Berman, David Simchi-Levi

Transp. Sci., 1988

The minimax multistop location problem on a tree.

Oded Berman, David Simchi-Levi, Arie Tamir

Networks, 1988

A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks.

David Simchi-Levi, Oded Berman

Oper. Res., 1988

1987

The Stochastic Queue <i>p</i>-Median Problem.

Oded Berman, Richard C. Larson, Cekil Parkan

Transp. Sci., 1987

Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations.

Oded Berman, Gabriel Y. Handler

Transp. Sci., 1987

1986

Cooperation among flexible manufacturing systems.

Oded Berman, Oded Maimon

IEEE J. Robotics Autom., 1986

Minisum location of a traveling salesman.

Oded Berman, David Simchi-Levi

Networks, 1986

1985

Optimal Location-Relocation Decisions on Stochastic Networks.

Oded Berman, Mina Rasty Rahnama

Transp. Sci., 1985

Optimal 2-Facility Network Districting in the Presence of Queuing.

Oded Berman, Richard C. Larson

Transp. Sci., 1985

Locating a facility on a congested network with random lengths.

Oded Berman

Networks, 1985

Optimal Server Location on a Network Operating as an <i>M</i>/<i>G</i>/1 Queue.

Oded Berman, Richard C. Larson, Samuel S. Chiu

Oper. Res., 1985

The value of an information system for service networks.

Zvi Adar, Niv Ahituv, Oded Berman

Comput. Oper. Res., 1985

1984

Location-Relocation of Mobile Facilities on a Stochastic Network.

Oded Berman, B. LeBlanc

Transp. Sci., 1984

1983

A procedure for dispatching moving mobile servers.

Oded Berman, Mina Rasty Rahnama

Networks, 1983

1982

Locating mobile servers on a network with markovian properties.

Oded Berman, Amedeo R. Odoni

Networks, 1982

The median problem with congestion.

Oded Berman, Richard C. Larson

Comput. Oper. Res., 1982

1981

Repositioning of Two Distinguishable Service Vehicles on Networks.

Oded Berman

IEEE Trans. Syst. Man Cybern., 1981

Repositioning of distinguishable urban service units on networks.

Oded Berman

Comput. Oper. Res., 1981