On Two Class-Constrained Versions of the Multiple Knapsack Problem ∗ Hadas Shachnai † - Computational complexity of mathematical operations - Document - PDFSEARCH.IO

First Page	Meta Content
	On Two Class-Constrained Versions of the Multiple Knapsack Problem ∗ Hadas Shachnai † Add to Reading List Document Date: 2013-04-15 10:32:13 Open Document File Size: 199,49 KB Share Result on Facebook City Haifa / / Country Italy / / / / IndustryTerm dual approximation algorithm / greedy algorithms / rst solution / storage management / polynomial time algorithm / multimedia storage sub-systems / greedy algorithm / complicated algorithm / ineﬃcient solutions / disk sub-systems / above algorithm / eﬃcient solutions / approximate solutions / designated integral processing times / feasible solutions / approximation algorithms / rst algorithm / infeasible solution / / Organization Fund for the Promotion of Research / Technion V / Tami Tamir‡ Department / Smoler Research Fund / Technion / / Person Tami Tamir / / / Position Author / Prime Minister / Contact author / / Technology above algorithm / rst algorithm / obtaining approximation algorithms / load balancing / polynomial time algorithm / LRTF algorithm / Greedy algorithm / approximation algorithms / second algorithm / dual approximation algorithm / / SocialTag Operations research Combinatorial optimization NP-complete problems Mathematical optimization Dynamic programming Knapsack problem Job shop scheduling Optimization problem Polynomial-time approximation scheme Theoretical computer science

On Two Class-Constrained Versions of the Multiple Knapsack Problem ∗ Hadas Shachnai †Add to Reading List