Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5532462> ?p ?o }
Showing triples 1 to 18 of
18
with 100 triples per page.
- Q5532462 subject Q7013789.
- Q5532462 subject Q7481159.
- Q5532462 abstract "In applied mathematics, the maximum generalized assignment problem is a problem in combinatorial optimization. This problem is a generalization of the assignment problem in which both tasks and agents have a size. Moreover, the size of each task might vary from one agent to the other. This problem in its most general form is as follows:-There are a number of agents and a number of tasks. Any agent can be assigned to perform any task, incurring some cost and profit that may vary depending on the agent-task assignment. Moreover, each agent has a budget and the sum of the costs of tasks assigned to it cannot exceed this budget. It is required to find an assignment in which all agents do not exceed their budget and total profit of the assignment is maximized.".
- Q5532462 wikiPageExternalLink ga-soda06.pdf.
- Q5532462 wikiPageExternalLink 2006-IPL-Generalized-Assignment-Problem.pdf.
- Q5532462 wikiPageWikiLink Q1137554.
- Q5532462 wikiPageWikiLink Q1333872.
- Q5532462 wikiPageWikiLink Q170084.
- Q5532462 wikiPageWikiLink Q33521.
- Q5532462 wikiPageWikiLink Q392811.
- Q5532462 wikiPageWikiLink Q4653447.
- Q5532462 wikiPageWikiLink Q6042592.
- Q5532462 wikiPageWikiLink Q620614.
- Q5532462 wikiPageWikiLink Q7013789.
- Q5532462 wikiPageWikiLink Q7481159.
- Q5532462 wikiPageWikiLink Q864457.
- Q5532462 comment "In applied mathematics, the maximum generalized assignment problem is a problem in combinatorial optimization. This problem is a generalization of the assignment problem in which both tasks and agents have a size. Moreover, the size of each task might vary from one agent to the other. This problem in its most general form is as follows:-There are a number of agents and a number of tasks.".
- Q5532462 label "Generalized assignment problem".