• Shop by category
  • Powered by eBay
  • The Quadratic Assignment Problem: Theory and Algorithms by E. Cela (English) Har

    • Item No : 135771770207
    • Condition : Brand New
    • Brand : No brand Info
    • Seller : the_nile
    • Current Bid : US $188.78
    • * Item Description

    • 2 Exact Algorithms and Lower Bounds. - 3 Heuristics and Asymptotic Behavior. - 5 Two More Restricted Versions of the QAP. - Notation Index. The QAP is a problem from both theoretical and practical points of view: the QAP is NP-hard to solve to optimality and to approximate within a constant approximation ratio; and QAP instances of size larger than 22 are still considered intractable.
    ★ Recommended Products Related To This Item
    ♥ Best Selling Products in this category