Eitan Zemel - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2010

A note on the properties of the optimal solution(s) of the Greed and Regret problemAnshul Sheopuri, Eitan Zemel. eor, 204(3):690-693, 2010. [doi]

2001

A General Framework for the Study of Decentralized Distribution SystemsRavi Anupindi, Yehuda Bassok, Eitan Zemel. msom, 3(4):349-368, 2001. [doi]

1996

Learning from Mistakes: A Note on Just-in-Time SystemsCarlos Ocaña, Eitan Zemel. ior, 44(1):206-214, 1996. [doi]

1993

The Complexity of Eliminating Dominated StrategiesItzhak Gilboa, Ehud Kalai, Eitan Zemel. mor, 18(3):553-565, 1993. [doi]

Hashing vectors for tabu searchDavid L. Woodruff, Eitan Zemel. anor, 41(2):123-137, 1993. [doi]

1992

Competitive location in the planeZvi Drezner, Eitan Zemel. anor, 40(1):173-193, 1992. [doi]

The Complexity of Lifted Inequalities for the Knapsack ProblemDavid Hartvigsen, Eitan Zemel. DAM, 39(2):113-123, 1992. [doi]

1991

A linear-time algorithm for solving continuous maximin knapsack problemsTakahito Kuno, Hiroshi Konno, Eitan Zemel. orl, 10(1):23-26, 1991. [doi]

1989

Is every cycle basis fundamental?David Hartvigsen, Eitan Zemel. jgt, 13(1):117-137, 1989. [doi]

Easily Computable Facets of the Knapsack PolytopeEitan Zemel. mor, 14(4):760-764, 1989. [doi]

1988

Probabilistic Analysis of the Capacitated Transportation ProblemRefael Hassin, Eitan Zemel. mor, 13(1):80-89, 1988. [doi]

1987

A Linear Time Randomizing Algorithm for Searching Ranked FunctionsEitan Zemel. algorithmica, 2:81-90, 1987.

1986

An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center ProblemNimrod Megiddo, Eitan Zemel. jal, 7(3):358-368, 1986.

Random Binary Search: A Randomizing Algorithm for Global Optimization in $R^1$Eitan Zemel. mor, 11(4):651-662, 1986. [doi]

1985

On Shortest Paths in Graphs with Random WeightsRefael Hassin, Eitan Zemel. mor, 10(4):557-564, 1985. [doi]

1984

On the Core and Dual Set of Linear Programming GamesDov Samet, Eitan Zemel. mor, 9(2):309-316, 1984. [doi]

An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related ProblemsEitan Zemel. ipl, 18(3):123-128, 1984.

Probabilistic analysis of geometric location problemsEitan Zemel. anor, 1(3):215-238, 1984. [doi]

1982

Totally Balanced Games and Games of FlowEhud Kalai, Eitan Zemel. mor, 7(3):476-478, 1982. [doi]

Generalized Network Problems Yielding Totally Balanced GamesEhud Kalai, Eitan Zemel. ior, 30(5):998-1008, 1982. [doi]

Locating Centers on a Tree with Discontinuous Supply and Demand RegionsArie Tamir, Eitan Zemel. mor, 7(2):183-197, 1982. [doi]

Polynomial algorithms for estimating network reliabilityEitan Zemel. networks, 12(4):439-452, 1982. [doi]

1981

An O(n log² n) Algorithm for the k-th Longest Path in a Tree with Applications to Location ProblemsNimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran. SICOMP, 10(2):328-337, 1981.

Measuring the Quality of Approximate Solutions to Zero-One Programming ProblemsEitan Zemel. mor, 6(3):319-332, 1981. [doi]

On search over rationalsEitan Zemel. orl, 1(1):34-38, 1981. [doi]

1980

An Algorithm for Large Zero-One Knapsack ProblemsEgon Balas, Eitan Zemel. ior, 28(5):1130-1154, 1980. [doi]

The Linear Multiple Choice Knapsack ProblemEitan Zemel. ior, 28(6):1412-1423, 1980. [doi]

1978

Lifting the facets of zero-one polytopesEitan Zemel. mp, 15(1):268-277, 1978. [doi]

1977

Critical Cutsets of Graphs and Canonical Facets of Set-Packing PolytopesEgon Balas, Eitan Zemel. mor, 2(1):15-19, 1977. [doi]

Sign in or sign up to see more results.

runs on WebDSL