Marsten roy (49 resultados)

Condición: New.

Paperback or Softback. Condición: New. A Hybrid Approach to Discrete Mathematical Programming. Book.

Condición: New.

Condición: New.

Condición: New.

Condición: New.

Condición: As New. Unread book in perfect condition.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Condición: New. In English.

Condición: New.

Condición: New.

Condición: New.

Paperback. Condición: New. New copy - Usually dispatched within 4 working days.

HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.

HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Condición: As New. Unread book in perfect condition.

Condición: As New. Unread book in perfect condition.

HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.

HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Condición: New.

Condición: New. In English.

Condición: New.

Condición: As New. Unread book in perfect condition.

Taschenbuch. Condición: Neu. Neuware - Dynamic programming is a powerful tool for solving a wide range of optimization problems, from scheduling to resource allocation to network design. This book presents an innovative approach to solving these problems using the branch and bound method, a technique that has typically been used for solving combinatorial problems. With clear explanations, insightful examples, and practical advice, Roy E. Marsten and Thomas L. Morin show how to apply this powerful approach to a variety of dynamic programming problems.This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it.This work is in the 'public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.…

Paperback. Condición: New. Print on Demand. This book offers a novel approach to solving integer programming problems. Integer programming is a complex mathematical optimization technique used in various fields to make optimal decisions. By introducing a new family of programs called parametric integer programs, the author provides a simplified approach to solving these programming problems. The book explores how a conventional branch-and-bound approach can be modified to solve such programs, offering a detailed explanation of the bounding test used to identify optimal solutions. The author illustrates the method using a small example and includes computational results for larger problems, showcasing the effectiveness of the approach. Overall, this book provides valuable insights into solving integer programming problems and will be of great interest to researchers and practitioners in optimization, mathematical programming, and related disciplines. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…

Condición: New.

Condición: New. KlappentextrnrnUnlike some other reproductions of classic texts (1) We have not used OCR(Optical Character Recognition), as this leads to bad quality books with introduced typos. (2) In books where there are images such as portraits, maps, sketc.

Wraps. Condición: Good. Presumed First Edition, First printing. [2], 27, [8] pages. Figure. References. Staplebound. Illustrated covers. Pencil notes on front cover. Cover has tape repairs. The author may have later joined the National Bureau of Economic Research (NBER). XMP is a hierarchically structured library of FORTRAN subroutines for linear programming. Its purpose is to facilitate algorithmic research and model development in operations research and related disciplines. The intended audience for XMP, the design goals that were identified as essential for serving that audience, and the way in which those goals were embodied in a working system, are described. Experience with XMP shows that an LP system can be designed primarily for flexibility and ease of modification without too great a sacrifice in computational efficiency. This paper was written to advance a particular viewpoint toward the development of mathematical software and to influence the designed of future systems of mathematical programming. This document appears to have been subsequently published in ACM Transactions on Mathematical Software 7(4):481-497 December 1981. Linear programming is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming (also known as mathematical optimization). More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints. Its feasible region is a convex polytope, which is a set defined as the intersection of finitely many half spaces, each of which is defined by a linear inequality. Its objective function is a real-valued affine (linear) function defined on this polyhedron. A linear programming algorithm finds a point in the polyhedron where this function has the smallest (or largest) value if such a point exists.…