Articles liés à Branch-and-Bound Applications in Combinatorial Data...
Synopsis
This book provides explanatory text, illustrative mathematics and algorithms, demonstrations of the iterative process, pseudocode, and well-developed examples for (familiar as well as novel) applications of the branch-and-bound paradigm to relevant problems in combinatorial data analysis.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
- ÉditeurSpringer
- Date d'édition2010
- ISBN 10 1441920390
- ISBN 13 9781441920393
- ReliureBroché
- Langueanglais
- Nombre de pages236
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 98,54
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour Branch-and-Bound Applications in Combinatorial Data...
Image fournie par le vendeur
Branch-and-Bound Applications in Combinatorial Data Analysis
Edité par
Springer New York, 2010
ISBN 10 : 1441920390
ISBN 13 : 9781441920393
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 . N° de réf. du vendeur 4172585
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Branch-and-Bound Applications in Combinatorial Data Analysis
Edité par
Springer New York Dez 2010, 2010
ISBN 10 : 1441920390
ISBN 13 : 9781441920393
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 236 pp. Englisch. N° de réf. du vendeur 9781441920393
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Branch-and-Bound Applications in Combinatorial Data Analysis
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 enumeration and evaluation of all solutions is computationally infeasible for all but the smallest problems. The branch-and-bound solution method is one type of partial enume- tion solution strategy that enables some combinatorial data analysis pr- lems to be solved optimally without explicitly enumerating all feasible solutions. To understand the operation of a branch-and-bound algorithm, we d- tinguish complete solutions from partial solutions. A complete solution is one for which a feasible solution to the optimization problem has been produced (e. g. , all objects are assigned to a group, or all objects are - signed a sequence position). A partial solution is an incomplete solution (e. g. , some objects are not assigned to a group, or some objects are not assigned a sequence position). N° de réf. du vendeur 9781441920393
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Branch-and-Bound Applications in Combinatorial Data Analysis
Edité par
Springer New York, Springer US Dez 2010, 2010
ISBN 10 : 1441920390
ISBN 13 : 9781441920393
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -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 enumeration and evaluation of all solutions is computationally infeasible for all but the smallest problems. The branch-and-bound solution method is one type of partial enume- tion solution strategy that enables some combinatorial data analysis pr- lems to be solved optimally without explicitly enumerating all feasible solutions. To understand the operation of a branch-and-bound algorithm, we d- tinguish complete solutions from partial solutions. A complete solution is one for which a feasible solution to the optimization problem has been produced (e. g. , all objects are assigned to a group, or all objects are - signed a sequence position). A partial solution is an incomplete solution (e. g. , some objects are not assigned to a group, or some objects are not assigned a sequence position).Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 236 pp. Englisch. N° de réf. du vendeur 9781441920393
Quantité disponible : 2 disponible(s)
Image d'archives
Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9781441920393_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Branch-and-Bound Applications in Combinatorial Data Analysis
Edité par
Springer-Verlag New York Inc., 2010
ISBN 10 : 1441920390
ISBN 13 : 9781441920393
Neuf
Paperback / softback
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 367. N° de réf. du vendeur C9781441920393
Quantité disponible : Plus de 20 disponibles
Image d'archives
Branch-and-Bound Applications in Combinatorial Data Analysis
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 236. N° de réf. du vendeur 263062587
Quantité disponible : 4 disponible(s)
Image d'archives
Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar2411530293840
Quantité disponible : Plus de 20 disponibles
Image d'archives
Branch-and-Bound Applications in Combinatorial Data Analysis
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Print on Demand pp. 236 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. N° de réf. du vendeur 5833956
Quantité disponible : 4 disponible(s)
Image d'archives
Branch-and-Bound Applications in Combinatorial Data Analysis
impression à la demandeVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. PRINT ON DEMAND pp. 236. N° de réf. du vendeur 183062577
Quantité disponible : 4 disponible(s)