Generalized assignment problem - PDFSEARCH.IO - Document Search Engine

Generalized assignment problem
Results: 9

#	Item
1	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 - Add to Reading List Source URL: www.coseal.net Language: English - Date: 2017-09-15 16:49:59
2	A Truthful-in-expectation Mechanism for the Generalized Assignment Problem Salman Fadaei and Martin Bichler Department of Informatics, TU München, Munich, Germany , Add to Reading List Source URL: dss.in.tum.de Language: English - Date: 2015-07-06 06:27:57 Game theory Convex optimization Linear programming Operations research Mechanism design Expected value VickreyClarkeGroves auction Submodular set function
3	Improved Results on Online Dynamic Bin Packing Mihai Burcea (Speaker) 1 †‡ Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2013-09-22 04:22:24 Packing problems Bin packing problem Sphere packing Bin Competitive analysis Knapsack problem Generalized assignment problem
4	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 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-01-05 09:50:09 Complexity classes Approximation algorithms NP-complete problems Matroid theory Generalized assignment problem Knapsack problem Submodular set function APX Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
5	Journal of Artificial Intelligence Research[removed]429 Submitted 6/06; published 3/07 Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems Add to Reading List Source URL: www.jair.org Language: English - Date: 2009-08-06 19:20:44 NP-complete problems Discrete geometry Operations research Combinatorial optimization Bin packing problem Generalized assignment problem Knapsack problem Packing problem Strongly NP-complete Theoretical computer science Computational complexity theory Mathematics
6	An Algorithm for the Generalized Quadratic Assignment Problem Peter M. Hahn1 Electrical and Systems Engineering, University of Pennsylvania Philadelphia, PA[removed], USA [removed] Bum-Jin Kim Add to Reading List Source URL: datamininglab.com Language: English Applied mathematics Combinatorial optimization Operations research Convex optimization Semidefinite programming Generalized assignment problem Branch and bound Assignment problem Matrix Mathematical optimization Mathematics Linear programming
7	PDF Document Add to Reading List Source URL: www-math.mit.edu Language: English - Date: 2005-12-20 11:13:05 NP-complete problems Combinatorial optimization Operations research Approximation algorithms Linear programming relaxation Generalized assignment problem APX Knapsack problem Dominating set Theoretical computer science Computational complexity theory Applied mathematics
8	PDF Document Add to Reading List Source URL: www.cs.technion.ac.il Language: English - 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
9	PDF Document Add to Reading List Source URL: www.acsu.buffalo.edu Language: English - Date: 2001-10-29 09:27:44 Theoretical computer science Combinatorial optimization Linear programming NP-complete problems Generalized assignment problem Relaxation Cutting-plane method Assignment problem David Shmoys Mathematical optimization Operations research Mathematics