Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing)
Brusco, Michael J., Stahl, Stephanie
€ 143.27
FREE Delivery in Ireland
Description for Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing)
Hardcover. There are a variety of combinatorial optimization problems that are relevant to the examination of statistical data. This work provides illustrative mathematics and algorithms, demonstrations of the iterative process, psuedocode, and examples for applications of the branch-and-bound paradigm to important problems in combinatorial data analysis. Series: Statistics and Computing. Num Pages: 222 pages, biography. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 14. Weight in Grams: 1120.
This monograph focuses on the application of the solution strategy known as branch-and-bound to problems of combinatorial data analysis. Combinatorial data analysis problems typically require either the sel- tion of a subset of objects from a larger (master) set, the grouping of a collection of objects into mutually exclusive and exhaustive subsets, or the sequencing of objects. To obtain verifiably optimal solutions for this class of problems, we must evaluate (either explicitly or implicitly) all feasible solutions. Unfortunately, the number of feasible solutions for problems of combinatorial data analysis grows exponentially with pr- lem size. For this reason, the explicit ... Read more
This monograph focuses on the application of the solution strategy known as branch-and-bound to problems of combinatorial data analysis. Combinatorial data analysis problems typically require either the sel- tion of a subset of objects from a larger (master) set, the grouping of a collection of objects into mutually exclusive and exhaustive subsets, or the sequencing of objects. To obtain verifiably optimal solutions for this class of problems, we must evaluate (either explicitly or implicitly) all feasible solutions. Unfortunately, the number of feasible solutions for problems of combinatorial data analysis grows exponentially with pr- lem size. For this reason, the explicit ... Read more
Product Details
Format
Hardback
Publication date
2005
Publisher
Springer
Condition
New
Series
Statistics and Computing
Number of Pages
222
Place of Publication
New York, NY, United States
ISBN
9780387250373
SKU
V9780387250373
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing)
From the reviews: "To say it unadorned at the outset, this excellent mongraph by Brusco and Stahl on applications of branch-and-bound algorithms in combinatorial data anlaysis fills a long neglected gap in the quantitative psychology literature, and will prove an indispensable companion to any researcher having serious interest in advanced techniques for seriation/scaling and nonhierarchical clustering." Psychometrika ... Read more