Assignment problem combinatorial optimization (5 résultats)

hardcover. Etat : Good. Ex-library copy, with the usual markings/stickers/stamping present. Well kept & very clean ex-library copy with only minimal/minor wear or signs of handling! Text/pictures are unmarked, crisp & clean pages. Binding is firm and square.

Etat : New.

Taschenbuch. Etat : 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 assignmentproblem is one of the fundamental combinatorial optimization problems inthe branch of optimization or operations research in mathematics. Itconsists of finding a maximum weight matching in a weighted bipartitegraph. In its most general form, the problem is as follows: There are anumber of agents and a number of tasks. Any agent can be assigned toperform any task, incurring some cost that may vary depending on theagent-task assignment. It is required to perform all tasks by assigningexactly one agent to each task in such a way that the total cost of theassignment is minimized. If the numbers of agents and tasks are equaland the total cost of the assignment for all tasks is equal to the sumof the costs for each agent (or the sum of the costs for each taskwhich is the same thing in this case), then the problem is called thelinear assignment problem. Commonly, when speaking of the assignmentproblem without any additional qualification, then the linear assignmentproblem is meant.…

Taschenbuch. Etat : 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. Etat : 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.…