Combinatorial Optimization for Undergraduates (Undergraduate Texts in Mathematics) Foulds, L R

L. R. Foulds

ISBN 10: 038790977X / ISBN 13: 9780387909776

Editore: Springer, 1984

Riguardo questo articolo

Shelfwear; the corners are slightly knocked. Content seems clean throughout, there is an ink & pencil inscription at the front. Overall a decent hardback.

Codice articolo 008659-6

Dati bibliografici

• Titolo: Combinatorial Optimization for Undergraduates (Undergraduate Texts in Mathematics) Foulds, L R
• Editore: Springer
• Data di pubblicazione: 1984
• Lingua: Inglese
• ISBN 10: 038790977X
• ISBN 13: 9780387909776
• Rilegatura: Rilegato
• Condizione: Very Good

Descrizione articolo

Riassunto

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.