Order Total (1 Item Items):
Shipping Destination:
Branch Bound Applications Combinatorial Data by Michael Brusco (30 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (30)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (24)
- As New, Fine or Near Fine (3)
- Very Good or Good (1)
- Fair or Poor (No further results match this refinement)
- As Described (2)
Binding
Collectible Attributes
- First Edition (1)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (8)
- Not Print on Demand (23)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Hardcover. Condition: Good. Dust Jacket Condition: No Dust Jacket. First Edition. An ex-library copy in original tan and blue hard covers. The usual ex-libris markings. The binding is sound, the text is clean/unmarked, and there is little cover wear. No dust jacket, apparently as issued. Book.
-
![Seller image for Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing) [Hardcover] Brusco, Michael J. and Stahl, Stephanie for sale by boredom books](https://pictures.abebooks.com/inventory/md/md31029629877.jpg)
Hardcover. Condition: Clean & Unmarked. Small black stripe on bottom edge. Very slight extremity wear. Otherwise a very nice clean & straight copy. No dust-jacket, as issued. 221 pp.
-
Condition: New. pp. 236.
-
Condition: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
-
Branch-and-Bound Applications in Combinatorial Data Analysis.
Book 1 of 37: Statistics and ComputingSeller: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Germany
Association Member: GIAQ ILAB VDA
Seller rating 4 out of 5 stars
XII, 221 p. Hardcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Statistics and Computing Sprache: Englisch.
-
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Condition: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
-
Branch And Bound Applications In Combinatorial Data Anamysis
Language: English
Published by Springer
Hardcover. Condition: New. ISBN:9780387250373 N.A.
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
-
Condition: As New. Unread book in perfect condition.
-
Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing)
Book 1 of 37: Statistics and ComputingSeller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 107.12
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing)
Book 1 of 37: Statistics and ComputingSeller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 107.12
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
-
Branch-and-Bound Applications in Combinatorial Data Analysis
Book 1 of 37: Statistics and ComputingSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 107.11
£ 15 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Branch And Bound Applications In Combinatorial Data Anamysis
Language: English
Published by Springer, 2005
Hardcover. Condition: New. ISBN:9780387250373.
-
Branch-and-Bound Applications in Combinatorial Data Analysis
Book 1 of 37: Statistics and ComputingSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 117.53
£ 15 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Condition: New. pp. 236.
-
Taschenbuch. Condition: Neu. Branch-and-Bound Applications in Combinatorial Data Analysis | Michael J. Brusco (u. a.) | Taschenbuch | Statistics and Computing | xii | Englisch | 2010 | Springer | EAN 9781441920393 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
International EditionHardcover. Condition: New. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 7-12 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
-
Buch. Condition: 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).
-
Condition: new. Questo è un articolo print on demand.
-
Branch-And-Bound Applications in Combinatorial Data Analysis
Book 1 of 37: Statistics and ComputingLanguage: English
Published by Springer New York Jul 2005, 2005
ISBN 10: 0387250379 ISBN 13: 9780387250373
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - 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). 222 pp. Englisch.
-
Condition: 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 .
-
Gebunden. Condition: 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 .
-
Condition: New. PRINT ON DEMAND pp. 236.
-
Condition: 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.
-
Branch-and-Bound Applications in Combinatorial Data Analysis
Book 1 of 37: Statistics and ComputingLanguage: English
Published by Springer, Springer Dez 2010, 2010
ISBN 10: 1441920390 ISBN 13: 9781441920393
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 236 pp. Englisch.
