ISBN: 9786132945426 - quadratic assignment problem: combinatorial optimization, optimization (mathematics), operations research, facilities location (4 Ergebnisse)

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 132 pp. Englisch.

Taschenbuch. Zustand: Neu. Quadratic Assignment Problem | Combinatorial Optimization, Optimization (Mathematics), Operations Research, Facilities Location | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786132945426 | 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.…

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 are aset 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.…

Taschenbuch. Zustand: 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 are aset 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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 132 pp. Englisch.…