Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 244 pp. Englisch.

Bestandsnummer des Verk�ufers 9781461395133

Verk�ufer kontaktieren

Diesen Artikel melden

Bibliografische Details

Titel: Combinatorial Optimization for Undergraduates
Verlag: Springer New York, Springer New York Feb 2012
Erscheinungsjahr: 2012
Sprache: Englisch
ISBN-10: 1461395135
ISBN-13: 9781461395133
Einband: Taschenbuch
Zustand: Neu

�ber diesen Titel

Inhaltsangabe

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.

Rese�a del editor

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.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

Impressum Thorsten Retsch Buchversand Mimpf2000 Ober�lschnitz 16 95517 Emtmannsberg Deutschland Telefon: 09209-2023188 Email: mimpf2000@online.de USt-ID-Nr.: DE 235096871 Wir f�hren gebrauchte B�cher aus allen Sparten der Literatur

Zur Homepage des Verk�ufers

Unternehmensdaten des Verk�ufers

buchversandmimpf2000
Germany

Gesch�ftsbedingungen und Versandinformationen

Verkaufsbedingungen

Widerrufsbelehrung/ Muster-Widerrufsformular/
Allgemeine Gesch�ftsbedingungen und Kundeninformationen/ Datenschutzerkl�rung

Widerrufsrecht f�r Verbraucher
(Verbraucher ist jede nat�rliche Person, die ein Rechtsgesch�ft zu Zwecken abschlie�t, die �berwiegend weder ihrer gewerblichen noch ihrer selbstst�ndigen beruflichen T�tigkeit zugerechnet werden k�nnen.)

Widerrufsbelehrung

Widerrufsrecht
Sie haben das Recht, binnen 14 Tagen ohne Angabe von Gr�nden diesen Vertrag zu widerrufen.
Die Widerrufsfr...

Mehr Information

Versandbedingungen

Soweit in der Artikelbeschreibung keine andere Frist angegeben ist, erfolgt die Lieferung der Ware innerhalb von 3-5 Werktagen nach Vertragsschluss, bei Vorauszahlung erst nach Eingang des vollst�ndigen Kaufpreises und der Versandkosten. Alle Preise inkl. MwSt.

Impressum & Info zum Verk�ufer