Gems of Combinatorial Optimization and Graph Algorithms
Kurzinformation
inkl. MwSt. Versandinformationen
Artikel zZt. nicht lieferbar
Artikel zZt. nicht lieferbar
Beschreibung
Gems of Combinatorial Optimization and Graph Algorithms
Produktdetails
So garantieren wir Dir zu jeder Zeit Premiumqualität.
Über den Autor
Andreas S. Schulz currently holds a chaired professorship at the Technische Universität München, where he has a joint appointment at the Center for Mathematics and the School of Management. Previously he was Head of the Operations Research and Statistics Group at the Sloan School of the Massachusetts Institute of Technology. His research interests span the theory and practice of mathematical optimization as well as computational economics and algorithmic game theory. Martin Skutella is full professor in the Department of Mathematics at TU Berlin and member of the Research Center \textsc{Matheon}, "Mathematics for Key Technologies," in Berlin. His main research interests lie in the area of efficient algorithms and combinatorial optimization, in particular in network optimization and scheduling. From 2009 to 2012, he was Editor-in-Chief of the Notices of the German Mathematical Society (DMV). Sebastian Stiller is Professor for Mathematical Optimization at TU Braunschweig, Germany. His research interests include robust optimization, game theory, network flows, and scheduling, with applications mainly in traffic, transport, logistics, and real-time systems. Dorothea Wagner heads the Institute of Theoretical Informatics at the Karlsruhe Institute of Technology. Her research interests are in the field of graph algorithms and algorithm engineering with a focus on traffic optimization, social network analysis and network visualization. She is currently a member of the German Council of Science and Humanities (Wissenschaftsrat) and served previously, for seven years as Vice President of the German Research Foundation (DFG).
- hardcover
- 504 Seiten
- Erschienen 2002
- Springer
- Gebunden
- 300 Seiten
- Erschienen 2008
- Springer
- Hardcover
- 240 Seiten
- Erschienen 1976
- De Gruyter
- Hardcover
- 648 Seiten
- Erschienen 2018
- Springer
- Hardcover
- 200 Seiten
- Erschienen 1996
- Princeton University Press
- Hardcover -
- Erschienen 2007
- Oldenbourg Wissenschaftsverlag
- Hardcover
- 706 Seiten
- Erschienen 1999
- Oreilly & Associates Inc
- paperback
- 1202 Seiten
- B&T
- paperback
- 532 Seiten
- Erschienen 1995
- Vieweg+Teubner Verlag
- Hardcover
- 256 Seiten
- Erschienen 2022
- Wiley & Sons
- hardcover
- 608 Seiten
- Erschienen 1992
- Springer
- hardcover
- 562 Seiten
- Erschienen 1995
- CRC Press Inc
- Hardcover
- 472 Seiten
- Erschienen 1997
- Springer
- Kartoniert
- 474 Seiten
- Erschienen 2022
- Springer Spektrum