default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEitan Zemel
Person information
- affiliation: New York University, Stern School of Business, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j30]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): 690-693 (2010)
2000 – 2009
- 2001
- [j29]Ravi Anupindi, Yehuda Bassok, Eitan Zemel:
A General Framework for the Study of Decentralized Distribution Systems. Manuf. Serv. Oper. Manag. 3(4): 349-368 (2001)
1990 – 1999
- 1996
- [j28]Carlos Ocaña, Eitan Zemel:
Learning from Mistakes: A Note on Just-in-Time Systems. Oper. Res. 44(1): 206-214 (1996) - 1993
- [j27]David L. Woodruff, Eitan Zemel:
Hashing vectors for tabu search. Ann. Oper. Res. 41(2): 123-137 (1993) - [j26]Itzhak Gilboa, Ehud Kalai, Eitan Zemel:
The Complexity of Eliminating Dominated Strategies. Math. Oper. Res. 18(3): 553-565 (1993) - 1992
- [j25]Zvi Drezner, Eitan Zemel:
Competitive location in the plane. Ann. Oper. Res. 40(1): 173-193 (1992) - [j24]David Hartvigsen, Eitan Zemel:
The Complexity of Lifted Inequalities for the Knapsack Problem. Discret. Appl. Math. 39(2): 113-123 (1992) - 1991
- [j23]Takahito Kuno, Hiroshi Konno, Eitan Zemel:
A linear-time algorithm for solving continuous maximin knapsack problems. Oper. Res. Lett. 10(1): 23-26 (1991)
1980 – 1989
- 1989
- [j22]David Hartvigsen, Eitan Zemel:
Is every cycle basis fundamental? J. Graph Theory 13(1): 117-137 (1989) - [j21]Eitan Zemel:
Easily Computable Facets of the Knapsack Polytope. Math. Oper. Res. 14(4): 760-764 (1989) - 1988
- [j20]Refael Hassin, Eitan Zemel:
Probabilistic Analysis of the Capacitated Transportation Problem. Math. Oper. Res. 13(1): 80-89 (1988) - 1987
- [j19]Eitan Zemel:
A Linear Time Randomizing Algorithm for Searching Ranked Functions. Algorithmica 2: 81-90 (1987) - 1986
- [j18]Nimrod Megiddo, Eitan Zemel:
An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem. J. Algorithms 7(3): 358-368 (1986) - [j17]Eitan Zemel:
Random Binary Search: A Randomizing Algorithm for Global Optimization in $R^1$. Math. Oper. Res. 11(4): 651-662 (1986) - 1985
- [j16]Refael Hassin, Eitan Zemel:
On Shortest Paths in Graphs with Random Weights. Math. Oper. Res. 10(4): 557-564 (1985) - 1984
- [j15]Eitan Zemel:
Probabilistic analysis of geometric location problems. Ann. Oper. Res. 1(3): 215-238 (1984) - [j14]Eitan Zemel:
An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems. Inf. Process. Lett. 18(3): 123-128 (1984) - [j13]Dov Samet, Eitan Zemel:
On the Core and Dual Set of Linear Programming Games. Math. Oper. Res. 9(2): 309-316 (1984) - 1982
- [j12]Ehud Kalai, Eitan Zemel:
Generalized Network Problems Yielding Totally Balanced Games. Oper. Res. 30(5): 998-1008 (1982) - [j11]Arie Tamir, Eitan Zemel:
Locating Centers on a Tree with Discontinuous Supply and Demand Regions. Math. Oper. Res. 7(2): 183-197 (1982) - [j10]Ehud Kalai, Eitan Zemel:
Totally Balanced Games and Games of Flow. Math. Oper. Res. 7(3): 476-478 (1982) - [j9]Eitan Zemel:
Polynomial algorithms for estimating network reliability. Networks 12(4): 439-452 (1982) - 1981
- [j8]Eitan Zemel:
Measuring the Quality of Approximate Solutions to Zero-One Programming Problems. Math. Oper. Res. 6(3): 319-332 (1981) - [j7]Eitan Zemel:
On search over rationals. Oper. Res. Lett. 1(1): 34-38 (1981) - [j6]Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran:
An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. SIAM J. Comput. 10(2): 328-337 (1981) - 1980
- [j5]Egon Balas, Eitan Zemel:
An Algorithm for Large Zero-One Knapsack Problems. Oper. Res. 28(5): 1130-1154 (1980) - [j4]Eitan Zemel:
The Linear Multiple Choice Knapsack Problem. Oper. Res. 28(6): 1412-1423 (1980)
1970 – 1979
- 1978
- [j3]Eitan Zemel:
Lifting the facets of zero-one polytopes. Math. Program. 15(1): 268-277 (1978) - 1977
- [j2]Egon Balas, Eitan Zemel:
Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes. Math. Oper. Res. 2(1): 15-19 (1977) - [j1]Egon Balas, Eitan Zemel:
Graph substitution and set packing polytopes. Networks 7(3): 267-284 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
