Person:761346: Difference between revisions

From MaRDI portal
Person:761346
Created automatically from import231006081045
 
m AuthorDisambiguator moved page Eitan Zemel to Eitan Zemel: Duplicate
 
(No difference)

Latest revision as of 17:51, 12 December 2023

Available identifiers

zbMath Open zemel.eitanMaRDI QIDQ761346

List of research outcomes

PublicationDate of PublicationType
A note on the properties of the optimal solution(s) of the greed and regret problem2010-03-01Paper
Learning from Mistakes: A Note on Just-in-Time Systems1996-10-13Paper
The Complexity of Eliminating Dominated Strategies1993-11-28Paper
Hashing vectors for tabu search1993-08-16Paper
The complexity of lifted inequalities for the knapsack problem1993-01-17Paper
Nash and correlated equilibria: Some complexity considerations1992-09-27Paper
Competitive location in the plane1992-01-01Paper
A linear-time algorithm for solving continuous maximin knapsack problems1991-01-01Paper
On the order of eliminating dominated strategies1990-01-01Paper
Small talk and cooperation: A note on bounded rationality1989-01-01Paper
Easily Computable Facets of the Knapsack Polytope1989-01-01Paper
Is every cycle basis fundamental?1989-01-01Paper
Probabilistic Analysis of the Capacitated Transportation Problem1988-01-01Paper
Comment on 'Some computational results on real 0-1 knapsack problems'1987-01-01Paper
A linear time randomizing algorithm for searching ranked functions1987-01-01Paper
An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem1986-01-01Paper
Random Binary Search: A Randomizing Algorithm for Global Optimization in $R^1$1986-01-01Paper
Probabilistic Analysis of Geometric Location Problems1985-01-01Paper
On Shortest Paths in Graphs with Random Weights1985-01-01Paper
An O(n) algorithm for the linear multiple choice knapsack problem and related problems1984-01-01Paper
On the Core and Dual Set of Linear Programming Games1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33404981984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38277701984-01-01Paper
The Maximum Coverage Location Problem1983-01-01Paper
Generalized Network Problems Yielding Totally Balanced Games1982-01-01Paper
Polynomial algorithms for estimating network reliability1982-01-01Paper
Locating Centers on a Tree with Discontinuous Supply and Demand Regions1982-01-01Paper
Totally Balanced Games and Games of Flow1982-01-01Paper
On search over rationals1981-01-01Paper
Measuring the Quality of Approximate Solutions to Zero-One Programming Problems1981-01-01Paper
An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems1981-01-01Paper
The Linear Multiple Choice Knapsack Problem1980-01-01Paper
An Algorithm for Large Zero-One Knapsack Problems1980-01-01Paper
Lifting the facets of zero–one polytopes1978-01-01Paper
Facets of the Knapsack Polytope From Minimal Covers1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38928821977-01-01Paper
Durability of Capital Goods: Taxes and Market Structure1977-01-01Paper
Graph substitution and set packing polytopes1977-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Eitan Zemel