Greedy algorithm - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2006-07-04 08:47:00 NP-complete problems Operations research Dynamic programming Approximation algorithms Generalized assignment problem Knapsack problem APX Algorithm Greedy algorithm Theoretical computer science Computational complexity theory Applied mathematics		Add to Reading List Source URL: www.cs.technion.ac.il Download Document from Source Website File Size: 136,98 KB Share Document on Facebook

	A Java Framework for (Online) Algorithm Selection With Use Case on the Generalized Assignment Problem Hans Degroote1, José Luis González Velarde² and Patrick De Causmaecker1 1KU Leuven Department of Computer Science - DocID: 1vjco - View Document
	A Truthful-in-expectation Mechanism for the Generalized Assignment Problem Salman Fadaei and Martin Bichler Department of Informatics, TU München, Munich, Germany , DocID: 1pGIo - View Document
	Improved Results on Online Dynamic Bin Packing Mihai Burcea (Speaker) 1 †‡ DocID: 1oZNq - View Document
	All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns Ron Adany1 , Moran Feldman2 , Elad Haramaty2 , Rohit Khandekar3 , Baruch Schieber4 , Roy Schwartz5 , Hadas Shachnai2 , and Tami T DocID: 17CWH - View Document
	Journal of Artificial Intelligence Research[removed]429 Submitted 6/06; published 3/07 Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems DocID: RWMl - View Document