Zemel Eitan

Eitan Zemel

Information about the author Eitan Zemel will soon be added to the site.
Found 6 papers in total
A general framework for the study of decentralized distribution systems
A general framework for the study of decentralized distribution systems
2001
We develop a general framework for the analysis of decentralized distribution systems....
The complexity of eliminating dominated strategies
The complexity of eliminating dominated strategies
1993
This paper deals with the computational complexity of some yes/no problems associated...
Hashing vectors for tabu search
Hashing vectors for tabu search
1993
Tabu search as proposed by Glover has proven to be a very effective meta-heuristic for...
The complexity of lifted inequalities for the knapsack problem
The complexity of lifted inequalities for the knapsack problem
1992
It is well known that one can obtain facets and valid inequalities for the knapsack...
A linear-time algorithm for solving continuous maximin knapsack problems
A linear-time algorithm for solving continuous maximin knapsack problems
1991
This paper introduces a special class of mathematical programming problem which...
Easily computable facets of the knapsack polytope
Easily computable facets of the knapsack polytope
1989
It is known that facets and valid inequalities for the knapsack polytope P can be...
Papers per page: