Combinatorial Data Analysis Optimization By Dynamic Programming(1st Edition)

Authors:

Lawrence Hubert ,Phipps Arabie ,Jacqueline Meulman

Type:Hardcover/ PaperBack / Loose Leaf
Condition: Used/New

In Stock: 1 Left

Shipment time

Expected shipping within 2 - 3 Days
Access to 35 Million+ Textbooks solutions Free
Ask Unlimited Questions from expert AI-Powered Answers 30 Min Free Tutoring Session
7 days-trial

Total Price:

$0

List Price: $13.99 Savings: $13.99 (100%)
Access to 30 Million+ solutions
Ask 50 Questions from expert AI-Powered Answers 24/7 Tutor Help Detailed solutions for Combinatorial Data Analysis Optimization By Dynamic Programming

Price:

$9.99

/month

Book details

ISBN: 0898714788, 978-0898714784

Book publisher: Society for Industrial and Applied Mathematics

Book Price $0 : Combinatorial Data Analysis (CDA) Refers To A Wide Class Of Methods For The Study Of Relevant Data Sets In Which The Arrangement Of A Collection Of Objects Is Absolutely Central. The Focus Of This Monograph Is On The Identification Of Arrangements, Which Are Then Further Restricted To Where The Combinatorial Search Is Carried Out By A Recursive Optimization Process Based On The General Principles Of Dynamic Programming (DP). The Authors Provide A Comprehensive And Self-contained Review Delineating A Very General DP Paradigm Or Schema That Can Serve Two Functions. First, The Paradigm Can Be Applied In Various Special Forms To Encompass All Previously Proposed Applications Suggested In The Classification Literature. Second, The Paradigm Can Lead Directly To Many More Novel Uses. An Appendix Is Included As A User's Manual For A Collection Of Programs Available As Freeware.