About: Generalized assignment problem

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Generalized assignment problem Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Disease, within Data Space : el.dbpedia.org associated with source document(s)

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.

Attributes	Values
rdf:type	disease
rdfs:label	Generalized assignment problem (en)
rdfs: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. (en)
sameAs	Generalized assignment problem Generalized assignment problem
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Reflist dbt:Short_description
Subject	Combinatorial optimization NP-complete problems
gold:hypernym	Problem
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Generalized_assignment_problem?oldid=1059458427&ns=0
Wikipage page ID	9124553 (xsd:integer)
page length (characters) of wiki page	5771 (xsd:nonNegativeInteger)
Wikipage revision ID	1059458427 (xsd:integer)
Link from a Wikipage to another Wikipage	NP-hardness Agent-based model Applied mathematics Assignment problem Combinatorial optimization Generalization NP-complete problems Combinatorial optimization Integer programming Knapsack problem
has 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. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Generalized_assignment_problem
is Wikipage redirect of	Generalized Assignment Problem
is Link from a Wikipage to another Wikipage of	Forest informatics Ant colony optimization algorithms Assignment problem Branch and price Generalized Assignment Problem David Shmoys List of NP-complete problems Gap Memetic algorithm Maximum cardinality matching
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Generalized_assignment_problem

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software