Descripción del título

"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."--Jacket
Monografía
monografia Rebiun25240492 https://catalogo.rebiun.org/rebiun/record/Rebiun25240492 m o d cr cn||||||||| 080226s2005 nyua fob 001 0 eng d GBA552338 bnb 64394510 213886883 228149626 228149627 228396498 320971086 437169764 618207335 647510997 756418887 814332650 823129502 824164765 880014090 992086205 994813649 1005765204 1035661679 1044171665 1044192246 1044314958 1047530386 1056327328 1056328254 1056401254 1060823958 1069409079 1074243464 1086911707 1097272084 1102295805 1110735781 1110779784 1112508755 1125531167 1136326616 9780387288109 0387288104 0387250379 hbk.) 9780387250373 hbk.) 1280313013 9781280313011 6610313016 9786610313013 10.1007/0-387-28810-4 doi AU@ 000042137208 AU@ 000044593242 AU@ 000048780880 DEBSZ 264335244 DEBSZ 396088627 DKDLA 820120-katalog:000661821 HEBIS 192019090 NLGGC 384203663 NZ1 12050438 978-0-387-25037-3 Springer http://www.springerlink.com GW5XE eng pn GW5XE OCLCQ YNG UAB DKU CNTRU E7B IDEBK OCLCQ N$T YDXCP TUU OCLCQ A7U OCLCQ OCLCF OCLCO DEBSZ DKDLA SLY OCLCQ EBLCP OCLCQ Z5A LIP PIFBR OTZ OCLCQ ESU OCLCQ VT2 WY@ LUE STF OCLCQ CEF EZ9 U3W OCLCQ WYU ICG UWO YOU CANPU OCLCQ W2U AUD OCLCQ ZHM DCT ERF SFB MAT 036000 bisacsh JBFF bicssc 511.6 22 05.42 bcl O157. 1 clc Brusco, Michael J. Branch-and-bound applications in combinatorial data analysis Michael J. Brusco, Stephanie Stahl New York Springer 2005 New York New York Springer 1 online resource (xii, 221 pages) illustrations 1 online resource (xii, 221 pages) Text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Statistics and computing Includes bibliographical references (pages 209-217) and index Introduction -- An Introduction to Branch-and-Bound Methods for Partitioning -- Minimum-Diameter Partitioning -- Minimum Within-Cluster Sums of Dissimilarities Partitioning -- Minimum Within-Cluster Sums of Squares Partitioning -- Multiobjective Partitioning -- Introduction to the Branch-and-Bound Paradigm for Seriation -- Maximization of a Dominance Index -- Seriation -- Maximization of Gradient Indices -- Seriation -- Unidimensional Scaling -- Seriation -- Multiobjective Seriation -- An Introduction to Branch-and-Bound Methods for Variable Selection -- Variable Selection for Cluster Analysis -- Variable Selection for Regression Analysis "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."--Jacket Combinatorial analysis Branch and bound algorithms Analyse combinatoire Algorithmes de séparation et évaluation MATHEMATICS- Combinatorics Combinatorial analysis Branch and bound algorithms Branch and bound algorithms Combinatorial analysis Electronic books Stahl, Stephanie Springer e-books Springer e-books Print version Brusco, Michael J. Branch-and-bound applications in combinatorial data analysis. New York : Springer, 2005 0387250379 9780387250373 (DLC) 2005924426 (OCoLC)60740994 Statistics and computing