Brusco michael j (39 Ergebnisse)

Hardcover. Zustand: Good. 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.

Zustand: New. pp. 236.

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

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.

Zustand: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.

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.

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.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Zustand: New.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Zustand: New.

Zustand: New.

Zustand: New. In English.

Zustand: As New. Unread book in perfect condition.

Zustand: New. In English.

Zustand: New. In English.

Zustand: New.

Hardback. Zustand: New. The use of spreadsheets to obtain solutions to a diverse array of examples offers a reader-friendly way of addressing a topic (optimization) that can sometimes be viewed as intimidating. Many people are readily familiar with spreadsheets and how they work, yet are apt to be unaware of the incredible power of Excel for solving some rather complex optimization problems. A major goal of the book is to sell readers on why it is so important to understand optimization, and a large collection of examples for a wide range of business decision making areas (e.g., production planning and scheduling, workforce planning and scheduling, location and supply chain distribution, location of emergency services, assembly line balancing, vehicle routing, project scheduling, revenue management, advertising, product design, payout schedules, productivity measurement, investment portfolio management, sports league scheduling, ranking models, etc.) affords a practical mechanism for achieving that goal. Another important contribution of the book is that it provides coverage of the mechanics of some common yet sophisticated statistical methods (regression, logistic regression, discriminant analysis, factor analysis, and cluster analysis), which are often opaque to many users of such methods.…

Hardcover. Zustand: New. ISBN:9780387250373.

Hardcover. Zustand: Brand New. 342 pages. 9.25x6.25x1.00 inches. In Stock.

Zustand: As New. Unread book in perfect condition.

Zustand: New. pp. 236.

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

Paperback. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Hardcover. Zustand: New Books. 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 6-10 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. …

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

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