Eitan Zemel

Publication Activity (10 Years)

Years Active: 1977-2010
Publications (10 Years): 0

Publications

Anshul Sheopuri, Eitan Zemel
A note on the properties of the optimal solution(s) of the Greed and Regret problem. Eur. J. Oper. Res. 204 (3) (2010)
Ravi Anupindi, Yehuda Bassok, Eitan Zemel
A General Framework for the Study of Decentralized Distribution Systems. Manuf. Serv. Oper. Manag. 3 (4) (2001)
Carlos Ocaña, Eitan Zemel
Learning from Mistakes: A Note on Just-in-Time Systems. Oper. Res. 44 (1) (1996)
Itzhak Gilboa, Ehud Kalai, Eitan Zemel
The Complexity of Eliminating Dominated Strategies. Math. Oper. Res. 18 (3) (1993)
David L. Woodruff, Eitan Zemel
Hashing vectors for tabu search. Ann. Oper. Res. 41 (2) (1993)
Zvi Drezner, Eitan Zemel
Competitive location in the plane. Ann. Oper. Res. 40 (1) (1992)
David Hartvigsen, Eitan Zemel
The Complexity of Lifted Inequalities for the Knapsack Problem. Discret. Appl. Math. 39 (2) (1992)
Takahito Kuno, Hiroshi Konno, Eitan Zemel
A linear-time algorithm for solving continuous maximin knapsack problems. Oper. Res. Lett. 10 (1) (1991)
David Hartvigsen, Eitan Zemel
Is every cycle basis fundamental? J. Graph Theory 13 (1) (1989)
Eitan Zemel
Easily Computable Facets of the Knapsack Polytope. Math. Oper. Res. 14 (4) (1989)
Refael Hassin, Eitan Zemel
Probabilistic Analysis of the Capacitated Transportation Problem. Math. Oper. Res. 13 (1) (1988)
Eitan Zemel
A Linear Time Randomizing Algorithm for Searching Ranked Functions. Algorithmica 2 (1987)
Nimrod Megiddo, Eitan Zemel
An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem. J. Algorithms 7 (3) (1986)
Eitan Zemel
Random Binary Search: A Randomizing Algorithm for Global Optimization in $R^1$. Math. Oper. Res. 11 (4) (1986)
Refael Hassin, Eitan Zemel
On Shortest Paths in Graphs with Random Weights. Math. Oper. Res. 10 (4) (1985)
Eitan Zemel
An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems. Inf. Process. Lett. 18 (3) (1984)
Dov Samet, Eitan Zemel
On the Core and Dual Set of Linear Programming Games. Math. Oper. Res. 9 (2) (1984)
Eitan Zemel
Probabilistic analysis of geometric location problems. Ann. Oper. Res. 1 (3) (1984)
Eitan Zemel
Polynomial algorithms for estimating network reliability. Networks 12 (4) (1982)
Ehud Kalai, Eitan Zemel
Generalized Network Problems Yielding Totally Balanced Games. Oper. Res. 30 (5) (1982)
Arie Tamir, Eitan Zemel
Locating Centers on a Tree with Discontinuous Supply and Demand Regions. Math. Oper. Res. 7 (2) (1982)
Ehud Kalai, Eitan Zemel
Totally Balanced Games and Games of Flow. Math. Oper. Res. 7 (3) (1982)
Eitan Zemel
Measuring the Quality of Approximate Solutions to Zero-One Programming Problems. Math. Oper. Res. 6 (3) (1981)
Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran
n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. SIAM J. Comput. 10 (2) (1981)
Eitan Zemel
On search over rationals. Oper. Res. Lett. 1 (1) (1981)
Egon Balas, Eitan Zemel
An Algorithm for Large Zero-One Knapsack Problems. Oper. Res. 28 (5) (1980)
Eitan Zemel
The Linear Multiple Choice Knapsack Problem. Oper. Res. 28 (6) (1980)
Eitan Zemel
Lifting the facets of zero-one polytopes. Math. Program. 15 (1) (1978)
Egon Balas, Eitan Zemel
Graph substitution and set packing polytopes. Networks 7 (3) (1977)
Egon Balas, Eitan Zemel
Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes. Math. Oper. Res. 2 (1) (1977)