Discrete Optimization Algorithms: With Pascal Programs (Paperback)

Maciej M. Syslo

ISBN 10: 0486453537 / ISBN 13: 9780486453538

Published by Dover Publications, New York, 2006

About this Item

Paperback. Upper-level undergraduates and graduate students will benefit from this treatment of discrete optimization algorithms, which covers linear and integer programming. It offers ready-to-use computer programs, together with their derivation and performance characteristics. Subjects include packing and covering, optimization on networks, and coloring and scheduling. 1983 edition. Upper-level undergraduates and graduate students will benefit from this treatment of discrete optimization algorithms, which covers linear and integer programming and offers a collection of ready-to-use computer programs. 1983 edition. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Seller Inventory # 9780486453538

Bibliographic Details

• Title: Discrete Optimization Algorithms: With Pascal Programs (Paperback)
• Publisher: Dover Publications, New York
• Publication Date: 2006
• Language: English
• ISBN 10: 0486453537
• ISBN 13: 9780486453538
• Binding: Paperback
• Condition: new

About this title

Synopsis

Rich in publications, the well-established field of discrete optimization nevertheless features relatively few books with ready-to-use computer programs. This book, geared toward upper-level undergraduates and graduate students, addresses that need. In addition, it offers a look at the programs' derivation and performance characteristics.
Subjects include linear and integer programming, packing and covering, optimization on networks, and coloring and scheduling. A familiarity with design, analysis, and use of computer algorithms is assumed, along with knowledge of programming in Pascal. The book can be used as a supporting text in discrete optimization courses or as a software handbook, with twenty-six programs that execute the most common algorithms in each topic area. Each chapter is self-contained, allowing readers to browse at will.