Eitan Zemel

According to our database, Eitan Zemel authored at least 30 papers between 1977 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

A note on the properties of the optimal solution(s) of the Greed and Regret problem.

Anshul Sheopuri, Eitan Zemel

Eur. J. Oper. Res., 2010

2001

A General Framework for the Study of Decentralized Distribution Systems.

Ravi Anupindi, Yehuda Bassok, Eitan Zemel

Manuf. Serv. Oper. Manag., 2001

1996

Learning from Mistakes: A Note on Just-in-Time Systems.

Carlos Ocaña, Eitan Zemel

Oper. Res., 1996

1993

The Complexity of Eliminating Dominated Strategies.

Itzhak Gilboa, Ehud Kalai, Eitan Zemel

Math. Oper. Res., 1993

Hashing vectors for tabu search.

David L. Woodruff, Eitan Zemel

Ann. Oper. Res., 1993

1992

The Complexity of Lifted Inequalities for the Knapsack Problem.

David Hartvigsen, Eitan Zemel

Discret. Appl. Math., 1992

Competitive location in the plane.

Zvi Drezner, Eitan Zemel

Ann. Oper. Res., 1992

1991

A linear-time algorithm for solving continuous maximin knapsack problems.

Takahito Kuno, Hiroshi Konno, Eitan Zemel

Oper. Res. Lett., 1991

1989

Easily Computable Facets of the Knapsack Polytope.

Eitan Zemel

Math. Oper. Res., 1989

Is every cycle basis fundamental?

David Hartvigsen, Eitan Zemel

J. Graph Theory, 1989

1988

Probabilistic Analysis of the Capacitated Transportation Problem.

Refael Hassin, Eitan Zemel

Math. Oper. Res., 1988

1987

A Linear Time Randomizing Algorithm for Searching Ranked Functions.

Eitan Zemel

Algorithmica, 1987

1986

Random Binary Search: A Randomizing Algorithm for Global Optimization in $R^1$.

Eitan Zemel

Math. Oper. Res., 1986

An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem.

Nimrod Megiddo, Eitan Zemel

J. Algorithms, 1986

1985

On Shortest Paths in Graphs with Random Weights.

Refael Hassin, Eitan Zemel

Math. Oper. Res., 1985

1984

On the Core and Dual Set of Linear Programming Games.

Dov Samet, Eitan Zemel

Math. Oper. Res., 1984

An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems.

Eitan Zemel

Inf. Process. Lett., 1984

Probabilistic analysis of geometric location problems.

Eitan Zemel

Ann. Oper. Res., 1984

1982

Polynomial algorithms for estimating network reliability.

Eitan Zemel

Networks, 1982

Locating Centers on a Tree with Discontinuous Supply and Demand Regions.

Arie Tamir, Eitan Zemel

Math. Oper. Res., 1982

Totally Balanced Games and Games of Flow.

Ehud Kalai, Eitan Zemel

Math. Oper. Res., 1982

Generalized Network Problems Yielding Totally Balanced Games.

Ehud Kalai, Eitan Zemel

Oper. Res., 1982

1981

An O(n log² n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems.

Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran

SIAM J. Comput., 1981

On search over rationals.

Eitan Zemel

Oper. Res. Lett., 1981

Measuring the Quality of Approximate Solutions to Zero-One Programming Problems.

Eitan Zemel

Math. Oper. Res., 1981

1980

The Linear Multiple Choice Knapsack Problem.

Eitan Zemel

Oper. Res., 1980

An Algorithm for Large Zero-One Knapsack Problems.

Egon Balas, Eitan Zemel

Oper. Res., 1980

1978

Lifting the facets of zero-one polytopes.

Eitan Zemel

Math. Program., 1978

1977

Graph substitution and set packing polytopes.

Egon Balas, Eitan Zemel

Networks, 1977

Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes.

Egon Balas, Eitan Zemel

Math. Oper. Res., 1977