Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Quadratic Assignment Problem: Operations Research,...
Immagini fornite dal venditore
Quadratic Assignment Problem
Print on DemandDa: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 132 pp. Englisch. Codice articolo 9786131260179
Compra nuovo
EUR 45,00
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Quadratic Assignment Problem : Operations Research, Mathematics, Facilities Location
Print on DemandDa: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Codice articolo 9786131260179
Compra nuovo
EUR 46,20
Spedizione EUR 61,08
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Quadratic Assignment Problem | Operations Research, Mathematics, Facilities Location
Print on DemandDa: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Quadratic Assignment Problem | Operations Research, Mathematics, Facilities Location | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131260179 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Codice articolo 113288479
Compra nuovo
EUR 143,90
Spedizione EUR 70,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili
Immagini fornite dal venditore
Quadratic Assignment Problem
Print on DemandDa: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. The quadraticassignment problem (QAP) is one of fundamental combinatorialoptimization problems in the branch of optimization or operationsresearch in mathematics, from the category of the facilities locationproblems. The problem models the following real-life problem: There area set of n facilities and a set of n locations. For each pair oflocations, a distance is specified and for each pair of facilities aweight or flow is specified (e.g., the amount of supplies transportedbetween the two facilities). The problem is to assign all facilities todifferent locations with the goal of minimizing the sum of the distancesmultiplied by the corresponding flows. The problem statement resemblesthat of the assignment problem, only the cost function is expressed interms of quadratic inequalities, hence the name.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 132 pp. Englisch. Codice articolo 9786131260179
Compra nuovo
EUR 180,00
Spedizione EUR 60,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili