Anbieter: Row By Row Bookshop, Sugar Grove, NC, USA
Erstausgabe
Hardcover. Zustand: Good. Zustand des Schutzumschlags: 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.
Hardcover. Zustand: 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.
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. pp. 236.
Anbieter: SMASS Sellers, IRVING, TX, USA
Zustand: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Anbieter: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Deutschland
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.
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Zustand: 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.
Zustand: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Anbieter: SMASS Sellers, IRVING, TX, USA
Zustand: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Sprache: Englisch
Verlag: Springer
Anbieter: Books in my Basket, New Delhi, Indien
Hardcover. Zustand: New. ISBN:9780387250373 N.A.
Zustand: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Zustand: 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.
Sprache: Englisch
Verlag: World Scientific Publishing Co Pte Ltd, 2024
ISBN 10: 9811294046 ISBN 13: 9789811294044
Anbieter: PBShop.store US, Wood Dale, IL, USA
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
Sprache: Englisch
Verlag: World Scientific Publishing Co Pte Ltd, 2024
ISBN 10: 9811294046 ISBN 13: 9789811294044
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
EUR 116,27
Anzahl: 15 verfügbar
In den WarenkorbHRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 115,66
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 127,86
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 127,86
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 127,85
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Springer, 2005
Anbieter: Books in my Basket, New Delhi, Indien
Hardcover. Zustand: New. ISBN:9780387250373.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 140,32
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 342 pages. 9.25x6.25x1.00 inches. In Stock.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 140,30
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 236.
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: 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.
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
EUR 153,98
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Anbieter: UK BOOKS STORE, London, LONDO, Vereinigtes Königreich
EUR 183,26
Anzahl: 3 verfügbar
In den WarenkorbHardcover. Zustand: 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.
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: 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).
Verlag: New York: Tony Shafrazi Gallery, 1983, 1983
Anbieter: °ART...on paper - 20th Century Art Books, Lugano, Schweiz
Verbandsmitglied: ILAB
Erstausgabe
Soft cover. Zustand: Very Good. 1st Edition. 4° - 72pp - B/w reproductions. Champions: John Ahearn (1951) - Donald Baechler (1956) - Jean-Michel Basquiat (1960-1988) - James Brown (1951) - Brett De Palma (1949)- Ronnie Cutrone (1948) - Keith Haring (1958-1990) - Futura 2000 - Tom Otterness (1952) - Kenny Scharf (1958) - Zadik Zadikian (1948). First edition, text in English. Original boards. In Very good condition.
Anbieter: Brook Bookstore On Demand, Napoli, NA, Italien
EUR 94,25
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: new. Questo è un articolo print on demand.
Sprache: Englisch
Verlag: Springer New York Jul 2005, 2005
ISBN 10: 0387250379 ISBN 13: 9780387250373
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Buch. Zustand: 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.