Eitan Zemel

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