![Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing) [Hardcover] Brusco, Michael J. and Stahl, Stephanie](https://d3525k1ryd2155.cloudfront.net/h/964/501/1452501964.0.m.jpg)
Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing) [Hardcover] Brusco, Michael J. and Stahl, Stephanie Hardback - 2005
by Brusco, Michael J.; Stahl, Stephanie
- Used
- Hardback
A$38.16
A$11.74
Delivery within USA
Standard delivery: 2 to 8 days
More delivery options
Standard delivery: 2 to 8 days
Details
- Title Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing) [Hardcover] Brusco, Michael J. and Stahl, Stephanie
- Author Brusco, Michael J.; Stahl, Stephanie
- Binding Hardback
- Edition INTERNATIONAL ED
- Condition Used - Clean & Unmarked
- Pages 222
- Volumes 1
- Language ENG
- Publisher Springer, New York
- Publication date 2005-07-22
- Illustrated Yes
- Features Bibliography, Illustrated, Index, Table of Contents
- Bookseller's Inventory # 58-E3HD-RJN1
- ISBN 9780387250373 / 0387250379
- Weight 1.02 lbs (0.46 kg)
- Dimensions 9.56 x 6.14 x 0.63 in (24.28 x 15.60 x 1.60 cm)
- Size 6x0x9
- Category Mathematics
- Library of Congress subjects Combinatorial analysis, Branch and bound algorithms
- Library of Congress Catalogue Number 2005924426
- Dewey Decimal Code 511.6
- Quantity available 1
About boredom books Oregon, United States
Biblio member since 2022
boredom books sells smart books to smart people Member Cascade Booksellers Association.
Reader reviews for Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing) [Hardcover] Brusco, Michael J. and Stahl, Stephanie
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
From the rear cover
There are a variety of combinatorial optimization problems that are relevant to the examination of statistical data. Combinatorial problems arise in the clustering of a collection of objects, the seriation (sequencing or ordering) of objects, and the selection of variables for subsequent multivariate statistical analysis such as regression. The options for choosing a solution strategy in combinatorial data analysis can be overwhelming. Because some problems are too large or intractable for an optimal solution strategy, many researchers develop an over-reliance on heuristic methods to solve all combinatorial problems. However, with increasingly accessible computer power and ever-improving methodologies, optimal solution strategies have gained popularity for their ability to reduce unnecessary uncertainty. In this monograph, optimality is attained for nontrivially sized problems via the branch-and-bound paradigm.
For many combinatorial problems, branch-and-bound approaches have been proposed and/or developed. However, until now, there has not been a single resource in statistical data analysis to summarize and illustrate available methods for applying the branch-and-bound process. This monograph provides clear explanatory text, illustrative mathematics and algorithms, demonstrations of the iterative process, psuedocode, and well-developed examples for applications of the branch-and-bound paradigm to important problems in combinatorial data analysis. Supplementary material, such as computer programs, are provided on the world wide web.
Dr. Brusco is a Professor of Marketing and Operations Research at Florida State University, an editorial board member for the Journal of Classification, and a member of the Board of Directors for the Classification Society of North America. Stephanie Stahl is an author and researcher with years of experience in writing, editing, and quantitative psychology research.
