Verwandte Artikel zu Algorithmic Principles of Mathematical Programming:...

Algorithmic Principles of Mathematical Programming: 24 (Texts in the Mathematical Sciences) - Softcover

 
9789048161171: Algorithmic Principles of Mathematical Programming: 24 (Texts in the Mathematical Sciences)

Inhaltsangabe

Algorithmic Principles of Mathematical Programming investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems. Recent advances in algorithmic theory have shown that the traditionally separate areas of discrete optimization, linear programming, and nonlinear optimization are closely linked. This book offers a comprehensive introduction to the whole subject and leads the reader to the frontiers of current research. The prerequisites to use the book are very elementary. All the tools from numerical linear algebra and calculus are fully reviewed and developed. Rather than attempting to be encyclopedic, the book illustrates the important basic techniques with typical problems. The focus is on efficient algorithms with respect to practical usefulness. Algorithmic complexity theory is presented with the goal of helping the reader understand the concepts without having to become a theoretical specialist. Further theory is outlined and supplemented with pointers to the relevant literature.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

Algorithmic Principles of Mathematical Programming investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems. Recent advances in algorithmic theory have shown that the traditionally separate areas of discrete optimization, linear programming, and nonlinear optimization are closely linked. This book offers a comprehensive introduction to the whole subject and leads the reader to the frontiers of current research. The prerequisites to use the book are very elementary. All the tools from numerical linear algebra and calculus are fully reviewed and developed. Rather than attempting to be encyclopedic, the book illustrates the important basic techniques with typical problems. The focus is on efficient algorithms with respect to practical usefulness. Algorithmic complexity theory is presented with the goal of helping the reader understand the concepts without having to become a theoretical specialist. Further theory is outlined and supplemented with pointers to the relevant literature.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

EUR 9,03 für den Versand innerhalb von/der USA

Versandziele, Kosten & Dauer

Weitere beliebte Ausgaben desselben Titels

9781402008528: Algorithmic Principles of Mathematical Programming: 24 (Texts in the Mathematical Sciences)

Vorgestellte Ausgabe

ISBN 10:  140200852X ISBN 13:  9781402008528
Verlag: Springer, 2002
Hardcover

Suchergebnisse für Algorithmic Principles of Mathematical Programming:...

Beispielbild für diese ISBN

Faigle, Ulrich, Kern, W., Still, G.
Verlag: Springer, 2010
ISBN 10: 9048161177 ISBN 13: 9789048161171
Neu Softcover

Anbieter: Kennys Bookstore, Olney, MD, USA

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. 2010. Softcover reprint of hardcover 1st ed. 2002. paperback. . . . . . Books ship from the US and Ireland. Artikel-Nr. V9789048161171

Verkäufer kontaktieren

Neu kaufen

EUR 161,90
Währung umrechnen
Versand: EUR 9,03
Innerhalb der USA
Versandziele, Kosten & Dauer

Anzahl: 15 verfügbar

In den Warenkorb

Foto des Verkäufers

Ulrich Faigle
ISBN 10: 9048161177 ISBN 13: 9789048161171
Neu Taschenbuch

Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Algorithmic Principles of Mathematical Programming investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems. Recent advances in algorithmic theory have shown that the traditionally separate areas of discrete optimization, linear programming, and nonlinear optimization are closely linked. This book offers a comprehensive introduction to the whole subject and leads the reader to the frontiers of current research. The prerequisites to use the book are very elementary. All the tools from numerical linear algebra and calculus are fully reviewed and developed. Rather than attempting to be encyclopedic, the book illustrates the important basic techniques with typical problems. The focus is on efficient algorithms with respect to practical usefulness. Algorithmic complexity theory is presented with the goal of helping the reader understand the concepts without having to become a theoretical specialist. Further theory is outlined and supplemented with pointers to the relevant literature. The book is equally suited for self-study for a motivated beginner and for a comprehensive course on the principles of mathematical programming within an applied mathematics or computer science curriculum at advanced undergraduate or graduate level. The presentation of the material is such that smaller modules on discrete optimization, linear programming, and nonlinear optimization can easily be extracted separately and used for shorter specialized courses on these subjects. Artikel-Nr. 9789048161171

Verkäufer kontaktieren

Neu kaufen

EUR 112,94
Währung umrechnen
Versand: EUR 62,67
Von Deutschland nach USA
Versandziele, Kosten & Dauer

Anzahl: 1 verfügbar

In den Warenkorb