Quadratic assignment problem combinatorial (4 risultati)

- Rilegato
Da: Books From California, Simi Valley, CA, U.S.A.Books From California
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Buono
EUR 118,48
EUR 4,44 spedizioneSpedito in U.S.A.Quantità: 1 disponibile
hardcover. Condizione: 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.

- Rilegato
Da: California Books, Miami, FL, U.S.A.California Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 185,30
EUR 2,67 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.

- Brossura
- Print on Demand
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 144,10
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: 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.…

- Brossura
- Print on Demand
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 186,74
EUR 35,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibile
Taschenbuch. Condizione: 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.…