Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing) - Image 1

£26.65

Springer Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing)

Name: Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing)
Brand: Springer
Price: 26.65 GBP
Availability: InStock

9780387250373

Anthropology & Sociology

This is the most expensive it has ever been. Walk away.

£27 today · previous high £27 · all-time low £25

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 26 days • 26 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 26 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £25 (16 days, 61.5%)

Price range: £25 - £27

Price levels: 2 different prices over 26 days

Description

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).

Product Specifications

Brand: Springer
Model: 9780387250373
Format: hardcover
ASIN: 0387250379
Category: Books > Subjects > Biography > Medical, Legal & Social Sciences > Anthropology & Sociology
Domain: Amazon UK
Release Date: 22 July 2005
Listed Since: 28 December 2006

Barcode

No barcode data available

Springer Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing)

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems

Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2

Combinatorial Programming: Methods and Applications: Proceedings of the NATO Advanced Study Institute held at the Palais des Congrès, Versailles, ... 1974: 19 (Nato Science Series C:, 19)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Combinatorial Optimization: Theory and Algorithms: 21 (Algorithms and Combinatorics, 21)

Combinatorial Optimization: Theory and Algorithms: 21 (Algorithms and Combinatorics, 21)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Combinatorial Algorithms: 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023, Proceedings: 13889 (Lecture Notes in Computer Science, 13889)

Combinatorial Algorithms: 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022, Proceedings: 13270 (Lecture Notes in Computer Science, 13270)

Integer Programming and Combinatorial Optimization: 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings: 3509 (Lecture Notes in Computer Science, 3509)

Art of Computer Programming, The, Volumes 1-4B, Boxed Set: Fundamental Algorithms / Seminumerical Algorithms / Sorting and Searching / Combinatorial ... Part 1 / Combinatorial Algorithms, Part 2

Wiley Applications of Combinatorial Optimization - Mathematics

Introduction to Combinatorial Optimization: 196 (Springer Optimization and Its Applications, 196)

Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization (Fields Institute Monographs)

Exact and Heuristic Methods in Combinatorial Optimization: A Study on the Linear Ordering and the Maximum Diversity Problem: 175 (Applied Mathematical Sciences, 175)

Springer Metaheuristics for Combinatorial Optimization 1332

Combinatorial and Algorithmic Mathematics: From Foundation to Optimization

Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions: 156 (Intelligent Systems Reference Library, 156)

An Introduction to Robust Combinatorial Optimization: Concepts, Models and Algorithms for Decision Making under Uncertainty (International Series in Operations Research & Management Science)

Exact and Heuristic Methods in Combinatorial Optimization: A Study on the Linear Ordering and the Maximum Diversity Problem: 175 (Applied Mathematical Sciences, 175)

Combinatorial Algorithms: 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021, Proceedings: 12757 (Lecture Notes in Computer Science, 12757)

Pedigree Polytopes: New Insights on Computational Complexity of Combinatorial Optimisation Problems

Logic-Based 0–1 Constraint Programming: 5 (Operations Research/Computer Science Interfaces Series, 5)

Design and Analysis of Approximation Algorithms: 62 (Springer Optimization and Its Applications, 62)