Publications

Selected Publications

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