Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 7-14 Tagen versandfertig
Veröffentlichung:	März 2026
Genre:	Schulbücher
ISBN:	9786131260179
EAN-Code:	9786131260179
Verlag:	Omniscriptum
Einband:	Kartoniert
Sprache:	English
Dimensionen:	H 220 mm / B 150 mm / D 8 mm
Gewicht:	215 gr
Seiten:	132
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The quadratic assignment problem (QAP) is one of 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. The problem statement resembles that of the assignment problem, only the cost function is expressed in terms of quadratic inequalities, hence the name.