• Sign In / Register
  • Help
  • Basket0
The books you love, the emails you want
Time is running out, opt in before 25 May or you'll stop hearing from us
Yes Please
Combinatorial Optimization for Undergraduates - Undergraduate Texts in Mathematics (Paperback)
  • Combinatorial Optimization for Undergraduates - Undergraduate Texts in Mathematics (Paperback)

Combinatorial Optimization for Undergraduates - Undergraduate Texts in Mathematics (Paperback)

Paperback 228 Pages / Published: 01/02/2012
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket

Check Marketplace availability

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 nature contained 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.

Publisher: Springer-Verlag New York Inc.
ISBN: 9781461395133
Number of pages: 228
Weight: 399 g
Dimensions: 244 x 156 x 18 mm
Edition: Softcover reprint of the original 1st ed. 198

You may also be interested in...

Applied Combinatorics 6E
Added to basket
Discrete Mathematics
Added to basket
Proofs from THE BOOK
Added to basket
A Combinatorial Introduction to Topology
Added to basket
Introduction to Graph Theory
Added to basket
Catalan Numbers
Added to basket
Combinatorial Optimization
Added to basket


Please sign in to write a review

Your review has been submitted successfully.