The following pages link to Eitan Zemel (Q761346):
Displaying 39 items.
- (Q689240) (redirect page) (← links)
- Competitive location in the plane (Q689241) (← links)
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems (Q761347) (← links)
- On the order of eliminating dominated strategies (Q911490) (← links)
- Comment on 'Some computational results on real 0-1 knapsack problems' (Q1089254) (← links)
- A linear time randomizing algorithm for searching ranked functions (Q1101237) (← links)
- On search over rationals (Q1170866) (← links)
- Nash and correlated equilibria: Some complexity considerations (Q1191824) (← links)
- The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
- Small talk and cooperation: A note on bounded rationality (Q1823173) (← links)
- A note on the properties of the optimal solution(s) of the greed and regret problem (Q2267682) (← links)
- A linear-time algorithm for solving continuous maximin knapsack problems (Q2277359) (← links)
- Hashing vectors for tabu search (Q2366997) (← links)
- Easily Computable Facets of the Knapsack Polytope (Q3032082) (← links)
- The Complexity of Eliminating Dominated Strategies (Q3140533) (← links)
- On the Core and Dual Set of Linear Programming Games (Q3323732) (← links)
- Measuring the Quality of Approximate Solutions to Zero-One Programming Problems (Q3325470) (← links)
- (Q3340498) (← links)
- Is every cycle basis fundamental? (Q3476832) (← links)
- The Maximum Coverage Location Problem (Q3661269) (← links)
- Probabilistic Analysis of Geometric Location Problems (Q3686393) (← links)
- On Shortest Paths in Graphs with Random Weights (Q3699721) (← links)
- An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem (Q3753765) (← links)
- Probabilistic Analysis of the Capacitated Transportation Problem (Q3799791) (← links)
- (Q3827770) (← links)
- Lifting the facets of zero–one polytopes (Q3865839) (← links)
- (Q3892882) (← links)
- The Linear Multiple Choice Knapsack Problem (Q3893672) (← links)
- An Algorithm for Large Zero-One Knapsack Problems (Q3896840) (← links)
- An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems (Q3906433) (← links)
- Generalized Network Problems Yielding Totally Balanced Games (Q3956717) (← links)
- Polynomial algorithms for estimating network reliability (Q3958250) (← links)
- Locating Centers on a Tree with Discontinuous Supply and Demand Regions (Q3964291) (← links)
- Totally Balanced Games and Games of Flow (Q3964297) (← links)
- Durability of Capital Goods: Taxes and Market Structure (Q4127601) (← links)
- Graph substitution and set packing polytopes (Q4138451) (← links)
- Facets of the Knapsack Polytope From Minimal Covers (Q4166575) (← links)
- Random Binary Search: A Randomizing Algorithm for Global Optimization in $R^1$ (Q4726059) (← links)
- Learning from Mistakes: A Note on Just-in-Time Systems (Q4883215) (← links)
