Oded Berman
According to our database^{1},
Oded Berman
authored at least 155 papers
between 1981 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on dl.acm.org
On csauthors.net:
Bibliography
2021
Eur. J. Oper. Res., 2021
2019
Perform. Evaluation, 2019
Truthful Cheap Talk: Why Operational Flexibility May Lead to Truthful Communication.
Manag. Sci., 2019
J. Oper. Res. Soc., 2019
Eur. J. Oper. Res., 2019
2018
Manuf. Serv. Oper. Manag., 2018
Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights.
Discret. Appl. Math., 2018
Location and Capacity Planning of Facilities with General ServiceTime Distributions Using Conic Optimization.
CoRR, 2018
2017
Exact analysis of the (R, Q) inventory policy in a twoechelon productioninventory system.
Oper. Res. Lett., 2017
Strategic Idleness and Dynamic Scheduling in an OpenShop Service Network: Case Study and Analysis.
Manuf. Serv. Oper. Manag., 2017
2016
Transp. Sci., 2016
Decis. Sci., 2016
Comput. Oper. Res., 2016
2015
Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand.
Oper. Res., 2015
Optimal Joint Replenishment and Transshipment Policies in a MultiPeriod Inventory System with Lost Sales.
Oper. Res., 2015
2014
Designing ProductionInventoryTransportation Systems with Capacitated CrossDocks.
Transp. Sci., 2014
Networks, 2014
Networks, 2014
Manuf. Serv. Oper. Manag., 2014
Using Strategic Idleness to Improve Customer Service Experience in Service Networks.
Oper. Res., 2014
Supporting New Product or Service Introductions: Location, Marketing, and Word of Mouth.
Oper. Res., 2014
2013
Continuous covering and cooperative covering problems with a general decay function on networks.
J. Oper. Res. Soc., 2013
2012
Profit Maximizing Distributed Service System Design with Congestion and Elastic Demand.
Transp. Sci., 2012
OR Spectr., 2012
Eur. J. Oper. Res., 2012
Eur. J. Oper. Res., 2012
Do Shareholders Really Prefer Their Executives to Maximize the Equity Value? A Newsvendor Case.
Decis. Sci., 2012
2011
Networks, 2011
Optimizing capacity, pricing and location decisions on a congested network with balking.
Math. Methods Oper. Res., 2011
J. Oper. Res. Soc., 2011
The minmax regret gradual covering location problem on a network with incomplete information of demand weights.
Eur. J. Oper. Res., 2011
On nfacility median problem with facilities subject to failure facing uniform demand.
Discret. Appl. Math., 2011
The probabilistic gradual covering location problem on a network with discrete random demand weights.
Comput. Oper. Res., 2011
Comput. Oper. Res., 2011
2010
Math. Methods Oper. Res., 2010
Comput. Oper. Res., 2010
Comput. Oper. Res., 2010
2009
Int. Trans. Oper. Res., 2009
Eur. J. Oper. Res., 2009
Eur. J. Oper. Res., 2009
Eur. J. Oper. Res., 2009
Decis. Sci., 2009
Discret. Appl. Math., 2009
Ann. Oper. Res., 2009
Efficient solution approaches for a discrete multifacility competitive interaction model.
Ann. Oper. Res., 2009
Ann. Oper. Res., 2009
2008
Oper. Res. Lett., 2008
Manuf. Serv. Oper. Manag., 2008
The probabilistic 1maximal covering problem on a network with discrete demand weights.
J. Oper. Res. Soc., 2008
J. Oper. Res. Soc., 2008
Optimizing pricing and location decisions for competitive service facilities charging uniform price.
J. Oper. Res. Soc., 2008
Eur. J. Oper. Res., 2008
Comput. Oper. Res., 2008
Comput. Oper. Res., 2008
2007
Transp. Sci., 2007
The 1minimax and 1maximin problems with demand weights of general probability distributions.
Networks, 2007
J. Oper. Res. Soc., 2007
J. Oper. Res. Soc., 2007
J. Oper. Res. Soc., 2007
Facility Reliability Issues in Network <i>p</i>Median Problems: Strategic Centralization and CoLocation Effects.
Oper. Res., 2007
Eur. J. Oper. Res., 2007
Eur. J. Oper. Res., 2007
Eur. J. Oper. Res., 2007
Eur. J. Oper. Res., 2007
The uncapacitated facility location problem with demanddependent setup and service costs and customerchoice allocation.
Eur. J. Oper. Res., 2007
Eur. J. Oper. Res., 2007
Eur. J. Oper. Res., 2007
Comput. Oper. Res., 2007
2006
Transp. Sci., 2006
Eur. J. Oper. Res., 2006
Eur. J. Oper. Res., 2006
2005
IEEE Trans. Syst. Man Cybern. Part A, 2005
The <i>m</i>machine flowshop problem with unittime operations and intree precedence constraints.
Oper. Res. Lett., 2005
Int. Trans. Oper. Res., 2005
Optimal management of crosstrained workers in services with negligible switching costs.
Eur. J. Oper. Res., 2005
A 6/5approximation algorithm for the twomachine routing openshop problem on a twonode network.
Eur. J. Oper. Res., 2005
An Improved IP Formulation for the Uncapacitated Facility Location Problem: Capitalizing on Objective Function Structure.
Ann. Oper. Res., 2005
2004
Networks, 2004
Dynamic inventory strategies for profit maximization in a service facility with stochastic service, demand and lead time.
Math. Methods Oper. Res., 2004
J. Oper. Res. Soc., 2004
A queueing control model for retail services having back room operations and crosstrained workers.
Comput. Oper. Res., 2004
Comput. Oper. Res., 2004
2003
Networks, 2003
Math. Methods Oper. Res., 2003
J. Oper. Res. Soc., 2003
J. Oper. Res. Soc., 2003
Eur. J. Oper. Res., 2003
Comput. Oper. Res., 2003
Ann. Oper. Res., 2003
2002
Parallel NCalgorithms for multifacility location problems with mutual communication and their applications.
Networks, 2002
Comput. Oper. Res., 2002
Locating Multiple Competitive Facilities: Spatial Interaction Models with Variable Expenditures.
Ann. Oper. Res., 2002
Ann. Oper. Res., 2002
Ann. Oper. Res., 2002
2001
Transp. Sci., 2001
Math. Methods Oper. Res., 2001
Comput. Oper. Res., 2001
2000
J. Oper. Res. Soc., 2000
INFORMS J. Comput., 2000
Eur. J. Oper. Res., 2000
Eur. J. Oper. Res., 2000
1999
A Simple Heuristic for mMachine FlowShop and its Applications in RoutingScheduling Problems.
Oper. Res., 1999
INFORMS J. Comput., 1999
Eur. J. Oper. Res., 1999
Comput. Oper. Res., 1999
Comput. Oper. Res., 1999
1998
Networks, 1998
The plant location problem with demanddependent setup costs and centralized allocation.
Eur. J. Oper. Res., 1998
Comput. Oper. Res., 1998
1997
(p  1)/(p + 1)approximate Algorithms for Ptraveling Salesmen Problems on a Tree with Minmax Objective.
Discret. Appl. Math., 1997
1996
Transp. Sci., 1996
Technical Note  A Sequential Location Scheme for the DistanceConstrained Multifacility Location Problem on a Tree.
Transp. Sci., 1996
IEEE Trans. Reliab., 1996
Networks, 1996
INFORMS J. Comput., 1996
A Heuristic with Worstcase Analysis for Minimax Routing of Two Travelling Salesmen on a Tree.
Discret. Appl. Math., 1996
1995
Transp. Sci., 1995
Probabilistic SalesDelivery Man and SalesDelivery Facility Location Problems on a Tree.
Transp. Sci., 1995
Networks, 1995
Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience.
Oper. Res., 1995
Discret. Appl. Math., 1995
Models for planning capacity expansion of convenience stores under uncertain demand and the value of information.
Ann. Oper. Res., 1995
Ann. Oper. Res., 1995
1994
Transp. Sci., 1994
Oper. Res. Lett., 1994
Networks, 1994
1993
IEEE Trans. Software Eng., 1993
1992
Transp. Sci., 1992
Ann. Oper. Res., 1992
1990
Information/communication and dispatching strategies for networks with mobile servers.
IEEE Trans. Syst. Man Cybern., 1990
Transp. Sci., 1990
Transp. Sci., 1990
Transp. Sci., 1990
Networks, 1990
Oper. Res., 1990
1989
Transp. Sci., 1989
Networks, 1989
1988
Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers.
Transp. Sci., 1988
Networks, 1988
Oper. Res., 1988
1987
Transp. Sci., 1987
Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations.
Transp. Sci., 1987
1986
IEEE J. Robotics Autom., 1986
Networks, 1986
1985
Transp. Sci., 1985
Transp. Sci., 1985
Networks, 1985
Oper. Res., 1985
Comput. Oper. Res., 1985
1984
Transp. Sci., 1984
1983
Networks, 1983
1982
Networks, 1982
Comput. Oper. Res., 1982
1981
IEEE Trans. Syst. Man Cybern., 1981
Comput. Oper. Res., 1981