Doprava zadarmo s Packetou nad 59.99 €
Pošta 4.49 SPS 4.99 Kuriér GLS 3.99 Zberné miesto GLS 2.99 Packeta kurýr 4.99 Packeta 2.99 SPS Parcel Shop 2.99

Branch-and-Bound Applications in Combinatorial Data Analysis

Jazyk AngličtinaAngličtina
Kniha Brožovaná
Kniha Branch-and-Bound Applications in Combinatorial Data Analysis Michael J. Brusco
Libristo kód: 01420916
Nakladateľstvo Springer-Verlag New York Inc., október 2010
This book provides clear explanatory text, illustrative mathematics and algorithms, demonstrations o... Celý popis
? points 331 b
131.62
Skladom u dodávateľa v malom množstve Odosielame za 13-16 dní

30 dní na vrátenie tovaru


Mohlo by vás tiež zaujímať


Computers and Games H. J. van den Herik / Brožovaná
common.buy 61.28
The Three Armadillies Tuff Jackie Mims Hopkins / Pevná
common.buy 13.48
Alchemist Ben Jonson / Pevná
common.buy 58.56

This book provides clear explanatory text, illustrative mathematics and algorithms, demonstrations of the iterative process, pseudocode, 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 an editorial board member for the Journal of Classification, and a member of the Board of Directors for the Classification Society of North America.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.

Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovaného

Prihlásenie

Prihláste sa k svojmu účtu. Ešte nemáte Libristo účet? Vytvorte si ho teraz!

 
povinné
povinné

Nemáte účet? Získajte výhody Libristo účtu!

Vďaka Libristo účtu budete mať všetko pod kontrolou.

Vytvoriť Libristo účet