The Quadratic Assignment Problem : Theory and Algorithms (Combinatorial Optimization, V. 1)

921.00 MYR
Member Price
828.90
English

Product Description

The quadratic assignment problem (QAP) was introduced in 1957 by Koopmans and Beckmann to model a plant location problem. Typical examples are the traveling salesman problem and a large number of optimization problems in graphs such as the maximum clique problem, the graph partitioning problem and the minimum feedback arc set problem.

Available to Order

Usually dispatches within 3-4 weeks

While every attempt has been made to ensure stock availability, occasionally we may run out of stock at our stores.

Free shipping for Peninsula on orders over 120.00MYR

Discount is applied at checkout.

Recently Viewed Items

Related Products