Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Eitan Zemel"'
Publikováno v:
Unintended Acceleration: Toyota's Recall Crisis
In late 2009 Toyota became the subject of media and U.S. government scrutiny after multiple deaths and injuries were attributed to accidents resulting from the unintended and uncontrolled acceleration of its cars. Despite Toyota's voluntary recall of
Autor:
Eitan Zemel, Anshul Sheopuri
Publikováno v:
European Journal of Operational Research. 204:690-693
The Greed and Regret problem is a simple model with applications in areas such as studies of crime, ultimatums, bidding, setting service levels and sales force compensation. In general, the Greed and Regret problem is not concave, and may admit sever
Autor:
Viral V. Acharya, Rangarajan K. Sundaram, Jennifer N. Carpenter, Xavier Gabaix, Kose John, Matthew Richardson, Marti G. Subrahmanyam, Eitan Zemel
Publikováno v:
Restoring Financial Stability. :179-196
Publikováno v:
Production and Operations Management. 17:121-138
Buyers often find that obtaining complete information about suppliers is costly. In such scenarios, there is a trade-off between the costs of obtaining information and the benefits that accrue to the owners of such information. There are also various
Managing Business Process Flows
Publikováno v:
Manufacturing & Service Operations Management. 3:349-368
We develop a general framework for the analysis of decentralized distribution systems. We carry the analysis in terms of a simplified model which entails N retailers who face stochastic demands and hold stocks locally and/or at one or more central lo
This is the eBook of the printed book and may not include any media, website access codes, or print supplements that may come packaged with the bound book.A structured, data-driven approach to understanding core operations management concepts. Anupin
Autor:
Eitan Zemel, David L. Woodruff
Publikováno v:
Annals of Operations Research. 41:123-137
Tabu search as proposed by Glover [3,4] has proven to be a very effective metaheuristic for hard problems. In this paper we propose that hash functions be used to record the solutions encountered during recent iterations of the search in a long list.
Autor:
Eitan Zemel, David Hartvigsen
Publikováno v:
Discrete Applied Mathematics. 39(2):113-123
It is well known that one can obtain facets and valid inequalities for the knapsack polytope by lifting simple inequalities associated with minimal covers. We study the complexity of lifting. We show that recognizing integral lifted facets or valid i