Anbieter: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Deutschland
EUR 4,95
Währung umrechnenAnzahl: 1 verfügbar
In den Warenkorbgebundene Ausgabe. Zustand: Gut. 221 Seiten Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber und kann entsprechende Merkmale aufweisen (Rückenschild, Instituts-Stempel.). In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 480.
Anbieter: Basi6 International, Irving, TX, USA
EUR 36,34
Währung umrechnenAnzahl: 8 verfügbar
In den WarenkorbZustand: 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
EUR 36,34
Währung umrechnenAnzahl: 5 verfügbar
In den WarenkorbZustand: 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.
Anbieter: SMASS Sellers, IRVING, TX, USA
EUR 37,95
Währung umrechnenAnzahl: 5 verfügbar
In den WarenkorbZustand: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
EUR 30,41
Währung umrechnenAnzahl: 4 verfügbar
In den WarenkorbZustand: New. pp. 236.
Anbieter: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Deutschland
EUR 12,00
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbXII, 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
EUR 62,44
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbZustand: 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.
Verlag: Springer
Sprache: Englisch
Anbieter: Books in my Basket, New Delhi, Indien
EUR 32,64
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbN.A. Zustand: New. ISBN:9780387250373 N.A.
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
EUR 79,88
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbZustand: 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.
Anbieter: Lucky's Textbooks, Dallas, TX, USA
EUR 112,23
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 113,76
Währung umrechnenAnzahl: 15 verfügbar
In den WarenkorbZustand: New.
Anbieter: Lucky's Textbooks, Dallas, TX, USA
EUR 112,57
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: California Books, Miami, FL, USA
EUR 126,97
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Verlag: Springer-Verlag New York Inc., New York, NY, 2005
ISBN 10: 0387250379 ISBN 13: 9780387250373
Sprache: Englisch
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
EUR 129,63
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: new. Hardcover. 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). This monograph focuses on the application of the solution strategy known as branch-and-bound to problems of combinatorial data analysis. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Verlag: Springer, 2005
Sprache: Englisch
Anbieter: Books in my Basket, New Delhi, Indien
EUR 110,05
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: New. ISBN:9780387250373.
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 132,86
Währung umrechnenAnzahl: 15 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 123,57
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 123,57
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 123,56
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 138,15
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: Books Puddle, New York, NY, USA
EUR 156,46
Währung umrechnenAnzahl: 4 verfügbar
In den WarenkorbZustand: New. pp. 236.
Anbieter: UK BOOKS STORE, London, LONDO, Vereinigtes Königreich
EUR 162,48
Währung umrechnenAnzahl: 16 verfügbar
In den WarenkorbHardcover. Zustand: New. Brand New ! Fast Delivery "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 4-6 Working days .and we do have flat rate for up to 2LB. Extra shipping charges will be requested This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
EUR 124,88
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. 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 .
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
EUR 123,67
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbBuch. 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).
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
EUR 174,45
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Like New. Like New. book.
Verlag: Springer-Verlag New York Inc., New York, NY, 2005
ISBN 10: 0387250379 ISBN 13: 9780387250373
Sprache: Englisch
Anbieter: AussieBookSeller, Truganina, VIC, Australien
EUR 220,46
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: new. Hardcover. 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). This monograph focuses on the application of the solution strategy known as branch-and-bound to problems of combinatorial data analysis. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Verlag: Springer New York Jul 2005, 2005
ISBN 10: 0387250379 ISBN 13: 9780387250373
Sprache: Englisch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
EUR 117,69
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbBuch. 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.
Anbieter: moluna, Greven, Deutschland
EUR 98,54
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: 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 .
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 165,78
Währung umrechnenAnzahl: 4 verfügbar
In den WarenkorbZustand: 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.
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
EUR 168,19
Währung umrechnenAnzahl: 4 verfügbar
In den WarenkorbZustand: New. PRINT ON DEMAND pp. 236.