Shortcuts
Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

Combinatorial Optimization for Undergraduates

Combinatorial Optimization for Undergraduates
Catalogue Information
Field name Details
Dewey Class 511.6
Title Combinatorial Optimization for Undergraduates ([EBook]) / by L. R. Foulds.
Author Foulds, L. R. , 1948-
Other name(s) SpringerLink (Online service)
Publication New York, NY : Springer US , 1984.
Physical Details XII, 228 pages : online resource.
Series Undergraduate texts in mathematics 0172-6056
ISBN 9781461395119
Summary Note 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.:
Contents note One: Techniques -- 0 Introduction to the Techniques of Combinatorial Optimization -- 1 Linear Programming and Extensions -- 2 Solution Techniques -- 3 Optimization on Graphs and Networks -- Two: Applications -- 4 Some Applications of Combinatorial Optimization Techniques -- 5 Appendix -- Further Reading.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site http://dx.doi.org/10.1007/978-1-4613-9511-9
Links to Related Works
Subject References:
Authors:
Corporate Authors:
Series:
Classification:
Catalogue Information 43608 Beginning of record . Catalogue Information 43608 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating43608
Quick Search