Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7268356> ?p ?o }
Showing triples 1 to 33 of
33
with 100 triples per page.
- Q7268356 subject Q8391417.
- Q7268356 subject Q9059596.
- Q7268356 abstract "The quadratic assignment problem (QAP) is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics, from the category of the facilities location problems.The problem models the following real-life problem:There are a set of n facilities and a set of n locations. For each pair of locations, a distance is specified and for each pair of facilities a weight or flow is specified (e.g., the amount of supplies transported between the two facilities). The problem is to assign all facilities to different locations with the goal of minimizing the sum of the distances multiplied by the corresponding flows.Intuitively, the cost function encourages factories with high flows between each other to be placed close together.The problem statement resembles that of the assignment problem, except that the cost function is expressed in terms of quadratic inequalities, hence the name.".
- Q7268356 wikiPageExternalLink ant-algorithm-applied-to-the-quadratic-assignment-.
- Q7268356 wikiPageExternalLink qapcodes_link.html.
- Q7268356 wikiPageExternalLink qaplib.
- Q7268356 wikiPageWikiLink Q1036748.
- Q7268356 wikiPageWikiLink Q1137554.
- Q7268356 wikiPageWikiLink Q11653.
- Q7268356 wikiPageWikiLink Q12916.
- Q7268356 wikiPageWikiLink Q1305598.
- Q7268356 wikiPageWikiLink Q1333872.
- Q7268356 wikiPageWikiLink Q141495.
- Q7268356 wikiPageWikiLink Q1520657.
- Q7268356 wikiPageWikiLink Q173350.
- Q7268356 wikiPageWikiLink Q180907.
- Q7268356 wikiPageWikiLink Q184793.
- Q7268356 wikiPageWikiLink Q194292.
- Q7268356 wikiPageWikiLink Q322212.
- Q7268356 wikiPageWikiLink Q3390760.
- Q7268356 wikiPageWikiLink Q395.
- Q7268356 wikiPageWikiLink Q44337.
- Q7268356 wikiPageWikiLink Q620614.
- Q7268356 wikiPageWikiLink Q6830528.
- Q7268356 wikiPageWikiLink Q7268355.
- Q7268356 wikiPageWikiLink Q80831.
- Q7268356 wikiPageWikiLink Q8366.
- Q7268356 wikiPageWikiLink Q8391417.
- Q7268356 wikiPageWikiLink Q9059596.
- Q7268356 wikiPageWikiLink Q92801.
- Q7268356 wikiPageWikiLink Q938821.
- Q7268356 comment "The quadratic assignment problem (QAP) is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics, from the category of the facilities location problems.The problem models the following real-life problem:There are a set of n facilities and a set of n locations.".
- Q7268356 label "Quadratic assignment problem".