Skip to content

Branch-And-Bound Applications in Combinatorial Data Analysis

Save 20% Save 20%
Original price Rs. 2,500.00
Original price Rs. 2,500.00 - Original price Rs. 2,500.00
Original price Rs. 2,500.00
Current price Rs. 2,000.00
Rs. 2,000.00 - Rs. 2,000.00
Current price Rs. 2,000.00
Condition: New

Exclusive Deals | Easy Replacement | Safe Checkout

💰 Get Cashback up to ₹250 on first Simpl payment

🎁 Use coupon code WELCOME to get discount on first order

🎁 Earn Reward Points on every purchase

📚 View Condition Chart of Books

New: These are new books which have been purchased from publishers and authors.

Almost New: These are books which have been read previously or are excess stock from bookshops and publishers. 

Good: These are the books which have have been sourced from book lovers and are in very good condition. They may have signs of ageing but will be in pretty good condition. 

Readable: These books may be old and have visible wear and tear signs. 

Learn more about our condition criteria here.

🚚 Read Our Free Shipping Policy

All prepaid orders above ₹299 are eligible for free shipping. Have more queries? Read more about our shipping and delivery policies here.

🔙 Super Easy Replacement Policy
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).

Bookish Santa's Promise

Genuine Books

No pirated copies ever

5 Quality Checks

No Quality Compromise

Careful Packaging

Books arrive to you safely

100% Satisfaction

Because we care for you

More Information:

Publisher: Springer
Language: English
Binding: Hardcover
Pages: 221
ISBN: 9780387250373

Related Categories: All Books Available Books Best Sellers Collectibles English Books Hardcover Editions New and Trending Books New Releases Newest Products

Popular Categories

Customer Reviews

No reviews yet