Synopsis
Master the math behind optimal decisions with proven tree-search methods.
This book presents reliable strategies for solving quadratic assignment problems using branch-and-bound techniques, linking theory to practical algorithms.
The discussion covers how these methods frame complex problems as related linear assignments, then use bounds and dominance tests to prune search space. It compares single-assignment and pair-assignment approaches, explains when each is most effective, and situates these techniques within the broader landscape of computational optimization.- Clear explanations of why quadratic assignment problems arise and how they relate to linear assignment
- Detailed discussion of reliable solution procedures and how they guarantee optimal results
- Practical guidance on bounding, pruning, and exploring search trees to speed up computation
- Illustrative examples that show how different strategies impact performance and accuracy
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Tree-Search Algorithms for Quadratic Assignment Problems...
Stock Image
Tree-Search Algorithms for Quadratic Assignment Problems (Classic Reprint)
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780666104328
Stock Image
Tree-Search Algorithms for Quadratic Assignment Problems (Classic Reprint)
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780666104328
Buy New
US$ 38.18
US$ 5.55 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available