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. ...
Read More
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).
Read Less
Add this copy of Branch-and-Bound Applications in Combinatorial Data to cart. $112.72, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2010 by Springer-Verlag New York Inc..
Add this copy of Branch-and-Bound Applications in Combinatorial Data to cart. $146.05, new condition, Sold by Ria Christie Books rated 4.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 2010 by Springer-Verlag New York Inc..
Add this copy of Branch-and-Bound Applications in Combinatorial Data to cart. $13.00, very good condition, Sold by Common Crow Books rated 5.0 out of 5 stars, ships from Pittsburgh, PA, UNITED STATES, published 2005 by Springer Verlag.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Near Fine. No Jacket. 221 pp. A near fine copy in boards. Hardcover. No dust jacket. Minimal edgewear. Text and contents are clean, bright and unmarked.
Add this copy of Branch-and-Bound Applications in Combinatorial Data to cart. $15.00, like new condition, Sold by Common Crow Books rated 5.0 out of 5 stars, ships from Pittsburgh, PA, UNITED STATES, published 2005 by Springer Verlag.
Add this copy of Branch-and-Bound Applications in Combinatorial Data to cart. $26.00, Sold by boredom books rated 4.0 out of 5 stars, ships from Portland, OR, UNITED STATES, published 2005 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Clean & Unmarked. Size: 6x0x9; Small black stripe on bottom edge. Very slight extremity wear. Otherwise a very nice clean & straight copy. No dust-jacket, as issued. 221 pp.
Add this copy of Branch-and-Bound Applications in Combinatorial Data to cart. $33.47, new condition, Sold by discount_scientific_books rated 5.0 out of 5 stars, ships from Sterling Heights, MI, UNITED STATES, published 2005 by Springer.
Add this copy of Branch-and-Bound Applications in Combinatorial Data to cart. $39.87, new condition, Sold by Media Smart rated 4.0 out of 5 stars, ships from Hawthorne, CA, UNITED STATES, published 2005 by Springer.
![Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing) [Hardcover] Brusco, Michael J. and Stahl, Stephanie](https://www0.alibris-static.com/imageid/2078110953_t.jpg)
