Eitan Zemel

{{Short description|American operations manager}}

Eitan Zemel is the Vice Dean for Strategic Initiatives and the W. Edwards Deming Professor of Quality and Productivity at New York University's Stern School of Business. He also teaches courses in operations management and operations strategy at NYU.{{Cite web |url=http://w4.stern.nyu.edu/faculty/facultyindex.cgi?id=164 |title=Eitan Zemel's profile at NYU Stern School of Business |access-date=2009-02-18 |archive-url=https://web.archive.org/web/20100613154330/http://w4.stern.nyu.edu/faculty/facultyindex.cgi?id=164 |archive-date=2010-06-13 }} Professor Zemel also teaches for the Master of Science in Business Analytics Program for Executives (MSBA), which is jointly hosted by NYU Stern and NYU Shanghai.{{cite web|title=Master of Science in Business Analytics|url=http://www.stern.nyu.edu/programs-admissions/global-degrees/business-analytics/index.htm}}

Academic interests

Zemel's research is focused on computations and algorithms. He developed the concepts used in the first practical algorithm for solving large knapsack problems and which are used in almost every efficient algorithm for this type of problem.

Other areas of Zemel's research include supply chain management, operations strategy, service operations, and incentive issues in operations management. His writing has appeared in numerous publications including The SIAM Journal on Applied Mathematics, Operations Research, Games and Economic Behavior, and Annals of Operations Research.

Zemel is also an associate editor of Manufacturing Review, Production and Operations Management, and Management Science, and the senior editor of Manufacturing and Service Operations.

Books

  • {{cite book |title=Managing Business Flows |author1=Anupindi, R. |author2=S. Chopra |author3=S. Deshmukh |author4=J.A. Van Mieghem |author5=E. Zemel |name-list-style=amp |year=1996 |publisher=Prentice Hall |location=New Jersey |isbn=978-0-13-067546-0}}

Publications

Eitan Zemel is a co-author of over 40 articles.[http://www.stern.nyu.edu/om/faculty/zemel/ Eitan Zemel's online publications resume]

  • {{cite book |title=A Comment on Some Computational Results on Real 0-1 Knapsack Problems |author1=Balas, E. |author2=R. Naus |author3=E. Zemel |publisher=Operations Research Letters |volume=6 |year=1987 |pages=139–141}}
  • {{cite book |title=An Algorithm for Large Zero-One Knapsack Problems |author1=Balas, E. |author2=E. Zemel |publisher=Operations Research |volume=28 |year=1980 |pages=1130–1154}}
  • {{cite book |title=Facets of the Knapsack Polytope from Minimal Covers |author1=Balas, E. |author2=E. Zemel |publisher=SIAM Journal on Applied Mathematics |volume=34 |year=1978 |pages=119–148}}
  • {{cite book |title=Graph Substitution and Set Packing Polytopes |author1=Balas, E. |author2=E. Zemel |publisher=Networks |volume=7 |year=1977 |pages=267–284}}
  • {{cite book |title=Lifting and Complementing Yields All the Facets of Positive Zero-One Polytopes |author1=Balas, E. |author2=E. Zemel |publisher=in: R. W. Cottle, H. L. Kelmanson, and B. Korte (eds.); Mathematical Programming |location= Amsterdam |year=1984 |pages=13–34}}
  • {{cite book |title=A General Framework for the Study of Decentralized Distribution Systems |author1=Bassok, Y. |author2=R. Anupindi |author3=E. Zemel |name-list-style=amp |year=2001 |publisher=MSOR |volume=3 |issue=4 |pages=349–368}}
  • {{cite book |title=Sourcing Through Auctions and Audits |author1=Chen, Ying-Ju |author2=S. Seshardi |author3=E. Zemel |name-list-style=amp |publisher=Production and Operations Management |date=March–April 2008 |pages=1–18}}
  • {{cite book |title=Competitive Location in the Plane |author1=Drezner, Z. |author2=E. Zemel |publisher=Annals of Operations Research |year=1992}}
  • {{cite book |title=On the Computation Complexity of Eliminating Dominated Strategies |author1=Gilboa, I. |author2=E. Kalai |author3=E. Zemel |name-list-style=amp |publisher=Math. of O.R. |volume=18 |year=1993 |pages=553–565}}
  • {{cite book |title=On the Order of Eliminating Dominated Strategies |author1=Gilboa, I. |author2=E. Kalai |author3=E. Zemel |name-list-style=amp |publisher=Operations Research Letters |volume=9 |year=1990 |pages=85–89}}
  • {{cite book |title=Nash and Correlated Equilibria: Some Complexity Results |author1=Gilboa, I. |author2=E. Zemel |publisher=Games and Economic Behavior |volume=1 |year=1989 |pages=80–93}}
  • {{cite book |title=The Maximum Coverage Location Problem |author1=Hakimi, L. |author2=N. Megiddo |author3=E. Zemel |name-list-style=amp |publisher=SIAM Journal on Discrete and Algebraic Methods |volume=4 |year=1983 |pages=253–261 | issue=2}}
  • {{cite book |title=On the Computational Complexity of Facets and Valid Inequalities for the Knapsack Problem |author1=Hartvigsen, D. |author2=E. Zemel |publisher=Discrete Applied Math |volume=39 |year=1992 |pages=113–123}}
  • {{cite book |title=On Shortest Paths in Graphs with Random Weights |author1=Hassin, R. |author2=E. Zemel |publisher=Mathematics of Operations Research |volume=10 |year=1984 |pages=557–564}}
  • {{cite book |title=Probabilistic Analysis of the Capacitated Transportation Problem |author1=Hassin, R. |author2=E. Zemel |publisher=Mathematics of Operations Research |volume=13 |year=1988 |pages=80–90}}
  • {{cite book |title=Generalized Network Problems Yielding Totally Balanced Games |author1=Kalai, E. |author2=E. Zemel |publisher=Operations Research |volume=30 |year=c. 1980s |pages=998–1008 | issue=4}}
  • {{cite book |title=On Totally Balanced Games and Games of Flow |author1=Kalai, E. |author2=E. Zemel |publisher=Mathematics of Operations Research |volume=7 |year=1982 |pages=476–478}}
  • {{cite book |title=Tangled Webs: A Note on the Complexity of Compound Lying |author1=Kamien, M. |author2=E. Zemel |publisher=Northwestern University |year=1994}}
  • {{cite book |title=A Linear Time Algorithm for Solving Continuous Maximin Knapsack Problems |author1=Kuno, T. |author2=H. Konno |author3=E. Zemel |publisher=O.R. Letters |volume=10 |year=1991 |pages=23, 27}}
  • {{cite book |title=An (n log2 n) Algorithm for the kth Longest Path in a Tree with Applications to Location Problems |author=Megiddo, N. |author2=A. Tamir |author3=E. Zemel |author4=R. Chandrasekaran |publisher=SIAM Journal on Computing |volume=13 |year=1981 |pages=328–338}}
  • {{cite book |title=An O(n log n) Randomized Algorithm for the Weighted Euclidean One Center Problem in the Plane |author1=Megiddo, N. |author2=E. Zemel |publisher=Journal of Algorithms |volume=7 |year=1986 |pages=358–368}}
  • {{cite book |title=A Discrete Maximum Principle Approach to General Advertising Expenditure Model |author1=Mitchelle, A. A. |author2=T. E. Morton |author3=E. Zemel |publisher=TIMS Studies in Management Science: Marketing, Planning Models (A. Zoltners, ed.); North-Holland Publishing |location= Amsterdam |year=1981}}
  • {{cite book |title=Learning from Mistakes: The JIT Principle |author1=Ocana, C. |author2=E. Zemel |publisher=Operations Research |volume=49 |year=1996 |pages=206–215}}
  • {{cite book |title=Durability of Capital Goods: Market Structure and Taxes |author1=Raviv, A. |author2=E. Zemel |publisher=Econometrica |volume=45 |year=1977 |pages=703–717}}
  • {{cite book |title=On the Core and Dual Set of Linear Programming Games |author1=Samet, D. |author2=E. Zemel |publisher=Mathematics of Operations Research |volume=9 |year=1984 |pages=309–316}}
  • {{cite book |title=The Greed and Regret Problem INFORMS doi 10.1287/xxxx.0000.0000 c ○ 0000 INFORMS |author1=Sheopuri, A. |author2=E. Zemel |year=2008}}
  • {{cite book |title=Locating Centers on a Tree with Discontinuous Supply and Demand Regions |author1=Tamir, A. |author2=E. Zemel |publisher=Mathematics of Operations Research |volume=7 |year=1982 |pages=183–198 | issue=2}}
  • {{cite book |title=Hashing Vectors for Tabu Search |author1=Woodruff, D. |author2=E. Zemel |publisher=Annals of O.R. |volume=41 |year=1993 |pages=123–137}}
  • {{cite book |title=Easily Computable Facets of the Knapsack Problem |author=Zemel, E. |publisher=Mathematics of Operations Research |volume=14 |year=1989 |pages=760–774}}
  • {{cite book |title=Lifting the Facets of O-1 Polytopes |author=Zemel, E. |publisher=Mathematical Programming |volume=15 |year=1978 |pages=268–277}}
  • {{cite book |title=A Linear Time Randomizing Algorithm for Searching Ranked Functions |author=Zemel, E. |publisher=Algorithmica |volume=2 |year=1987 |pages=81–90}}
  • {{cite book |title=Measuring the Quality of Approximate Solutions to Zero-One Programming Problems |author=Zemel, E. |publisher=Mathematics of Operations Research |volume=13 |year=1981 |pages=319–332}}
  • {{cite book |title=An O(n) Algorithm for the Multiple Choice Knapsack and Related Problems |author=Zemel, E. |publisher=Information Processing Letters |volume=18 |year=1984 |pages=123–128}}
  • {{cite book |title=On Search Over Rationals |author=Zemel, E. |publisher=Operations Research Letters |volume=1 |year=1981 |pages=34–38 | issue=1}}
  • {{cite book |title=Polynomial Algorithms for Estimating Best Possible Bounds on Network Reliability |author=Zemel, E. |publisher=Networks |volume=12 |year=c. 1980s |pages=439–452}}
  • {{cite book |title=Probabilistic Analysis of Geometric Location Problems |author=Zemel, E. |publisher=Annals of Operations Research |volume=1 |year=1984 |pages=215–238}}
  • {{cite book |title=Probabilistic Analysis of Geometric Location Problems (Revised) |author=Zemel, E. |publisher=SIAM Journal of Discrete and Algebraic Methods |volume=6 |year=1986 |pages=189–200}}
  • {{cite book |title=Random Binary Search: A Randomized Algorithm for Optimization in R1 |author=Zemel, E. |publisher=Mathematics of Operations Research |volume=11 |year=1986 |pages=651–662}}
  • {{cite book |title=Small Talk and Cooperation: A Note on Bounded Rationality |author=Zemel, E. |publisher=Journal of Economic Theory |volume=49 |year=1989 |pages=1–9}}
  • {{cite book |title=Yes, Virginia, There Really Is Total Quality Management |author=Zemel, E. |publisher=Anheuser-Bush Distinguished Lecture Series, SEI Center for Advanced Studies in Management, The Wharton School |year=1992}}

Education

Zemel received his Bachelor of Science in Mathematics from the Hebrew University of Jerusalem, his Master of Science in Applied Physics from The Weizmann Institute of Science in Israel, and his Doctor of Philosophy in Operations Research from the Graduate School of Business Administration at Carnegie Mellon University.

References

{{Reflist}}