Combinatorial Optimization for Undergraduates - L. R. Foulds
-30% ar kodu BOOKS
Piegāde 12-18 darba dienu laikā
30 dienu atgriešanas politika
The major purpose of this book is to introduce the main concepts of discrete optimization problems which have a finite number of feasible solutions. Following common practice, we term this topic combinatorial optimization. There are now a number of excellent graduate-level textbooks on combina torial optimization. However, there does not seem to exist an undergraduate text in this area. This book is design ... Pilns apraksts
Jums varētu patikt arī
TOP
The Demon-Haunted World: Science as a Candle in the Dark
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Art of Uncertainty: How to Navigate Chance, Ignorance, Risk and Luck
-30% ar kodu BOOKS
Nav noliktavā
TOP
Heart Rate Variability: Science and Strategies for Peak Performance
Marco Altini, Sylvain Laborde, Dan Plews, Emma Mosley
-30% ar kodu BOOKS
Nav noliktavā
TOP
Many Faces, One Purpose: A Manager's Handbook on Women in Firefighting
U. S. Fire Administration, Homeland Security
-30% ar kodu BOOKS
Nav noliktavā
TOP
Thinking in Systems: International Bestseller
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Gulf Moment: Arab Relations Since 2011
Florence Gaub, U. S. Army War College, Strategic Studies Institute
-30% ar kodu BOOKS
Nav noliktavā
TOP
Introduction to Algorithms
Ronald L. Rivest, Charles E. Leiserson, Clifford Stein, Thomas H. Cormen
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Skin in the Game: Hidden Asymmetries in Daily Life
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
101 Things I Learned in Architecture School
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Dinosaurs and Prehistoric Life: The Definitive Visual Guide to Prehistoric Animals
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Worth Dying For: The Power and Politics of Flags
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Crossing Borders: About the birth of the Consortium of European Research Libraries, the organisation's early years and its path to maturity, spanning the period from the late twentieth century to the first decades of the twenty-first century
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Only Dull People Are Brilliant at Breakfast
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Playing It by the Book: Printed and Manuscript Book Games in Early Modern Europe
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
International Economics: Theory and Policy, Global Edition
Paul Krugman, Maurice Obstfeld, Marc Melitz
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Unaccountability Machine: Why Big Systems Make Terrible Decisions
-30% ar kodu BOOKS
Piegādātāja noliktavā
Aprašymas
The major purpose of this book is to introduce the main concepts of discrete optimization problems which have a finite number of feasible solutions. Following common practice, we term this topic combinatorial optimization. There are now a number of excellent graduate-level textbooks on combina torial optimization. However, there does not seem to exist an undergraduate text in this area. This book is designed to fill this need. The book is intended for undergraduates in mathematics, engineering, business, or the physical or social sciences. It may also be useful as a reference text for practising engineers and scientists. The writing of this book was inspired through the experience of the author in teaching the material to undergraduate students in operations research, engineering, business, and mathematics at the University of Canterbury, New Zealand. This experience has confirmed the suspicion that it is often wise to adopt the following approach when teaching material of the naturecontained in this book. When introducing a new topic, begin with a numerical problem which the students can readily understand; develop a solution technique by using it on this problem; then go on to general problems. This philosophy has been adopted throughout the book. The emphasis is on plausibility and clarity rather than rigor, although rigorous arguments have been used when they contribute to the understanding of the mechanics of an algorithm.
Vairāk informācijas
| Autors | L. R. Foulds |
|---|---|
| Izdevējs | Springer New York |
| Izlaides gads | 2012 |
| Vāka tips | Mīkstais vāks |
| EAN | 9781461395133 |