Eitan Zemel

发表

On Communication, Bounded Complexity, and Cooperation

Eitan Zemel, Eitan Zemel, 1985 .

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

Eitan Zemel, Carlos Ocaña, Eitan Zemel, 1996, Oper. Res..

Polynomial algorithms for estimating network reliability

Eitan Zemel, Eitan Zemel, 1982, Networks.

Lifting the facets of zero–one polytopes

Eitan Zemel, Eitan Zemel, 1978, Math. Program..

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

Eitan Zemel, Anshul Sheopuri, 2010, Eur. J. Oper. Res..

Hashing vectors for tabu search

David L. Woodruff, Eitan Zemel, Eitan Zemel, 1993, Ann. Oper. Res..

Managing Business Process Flows with 3.5 Disk

Eitan Zemel, Sunil Chopra, Ravi Anupindi, 1999 .

Generalized Network Problems Yielding Totally Balanced Games

Eitan Zemel, Ehud Kalai, Eitan Zemel, 1982, Oper. Res..

The Complexity of Lifted Inequalities for the Knapsack Problem

Eitan Zemel, David Hartvigsen, Eitan Zemel, 1992, Discret. Appl. Math..

Probabilistic Analysis of the Capacitated Transportation Problem

Refael Hassin, Eitan Zemel, Eitan Zemel, 1988, Math. Oper. Res..

Easily Computable Facets of the Knapsack Polytope

Eitan Zemel, Eitan Zemel, 1989, Math. Oper. Res..

On the Core and Dual Set of Linear Programming Games

Dov Samet, Eitan Zemel, Eitan Zemel, 1984, Math. Oper. Res..

Is every cycle basis fundamental?

Eitan Zemel, David Hartvigsen, 1989, J. Graph Theory.

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

Egon Balas, Eitan Zemel, 1977, Math. Oper. Res..

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

Eitan Zemel, Eitan Zemel, 1984, Inf. Process. Lett..

The Complexity of Eliminating Dominated Strategies

Eitan Zemel, Itzhak Gilboa, Ehud Kalai, 1993, Math. Oper. Res..

Managing Business Process Flows

Eitan Zemel, Sunil Chopra, Jan A. Van Mieghem, 1999 .

Error Noted in a Paper by Jacobs, Silan, and Clemson

Egon Balas, Michael J. Todd, Eitan Zemel, 1998 .

On Thc Computational Complexity of Facets of the Knapsack Problem

Eitan Zemel, Eitan Zemel, 1986 .

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

Eitan Zemel, 1981, Math. Oper. Res..

The Linear Multiple Choice Knapsack Problem

Eitan Zemel, Eitan Zemel, 1980, Oper. Res..

A linear time randomizing algorithm for searching ranked functions

Eitan Zemel, 2005, Algorithmica.

Probabilistic analysis of geometric location problems

Eitan Zemel, Eitan Zemel, 1984, Ann. Oper. Res..

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

Eitan Zemel, 1986, Math. Oper. Res..

Competitive location in the plane

Zvi Drezner, Eitan Zemel, Eitan Zemel, 1986, Ann. Oper. Res..

A General Framework for the Study of Decentralized Distribution Systems

Eitan Zemel, Yehuda Bassok, Ravi Anupindi, 2001, Manuf. Serv. Oper. Manag..

An Algorithm for Large Zero-One Knapsack Problems

Egon Balas, Eitan Zemel, E. Balas, 1980, Oper. Res..

On search over rationals

Eitan Zemel, 1981, Oper. Res. Lett..

On Shortest Paths in Graphs with Random Weights

Refael Hassin, Eitan Zemel, Eitan Zemel, 1985, Math. Oper. Res..

A linear-time algorithm for solving continuous maximin knapsack problems

Hiroshi Konno, Eitan Zemel, Takahito Kuno, 1991, Oper. Res. Lett..

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

Nimrod Megiddo, Eitan Zemel, N. Megiddo, 1986, J. Algorithms.

Graph substitution and set packing polytopes

Egon Balas, Eitan Zemel, E. Balas, 1977, Networks.

Locating Centers on a Tree with Discontinuous Supply and Demand Regions

Eitan Zemel, Arie Tamir, 1982, Math. Oper. Res..

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

Nimrod Megiddo, Eitan Zemel, Arie Tamir, 1981, SIAM J. Comput..

Totally Balanced Games and Games of Flow

Eitan Zemel, Ehud Kalai, Eitan Zemel, 1982, Math. Oper. Res..

Sourcing Through Auctions and Audits

Eitan Zemel, Sridhar Seshadri, Ying-Ju Chen, 2008, Production and Operations Management.

All the Facets of Zero-One Programming Polytopes with Positive Coefficients.

Egon Balas, Eitan Zemel, 1975 .

Supply Intelligence

Eitan Zemel, Sridhar Seshadri, Eitan Zemel, 2003 .

On the order of eliminating dominated strategies

Eitan Zemel, Itzhak Gilboa, Ehud Kalai, 1990 .

Lifting the Facets of 0-1 Polytopes.

Eitan Zemel, 1974 .

Eitan Zemel, Itzhak Gilboa, I. Gilboa, 1989 .

Critical Cutsets of Graphs and Canonical Facets of Set Packing Polytopes

Egon Balas, Eitan Zemel, E. Balas, 1998 .