Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (14 chapters)
-
Front Matter
-
Decomposition Algorithms for Multi-Period Network Design
-
Front Matter
-
-
Iterative Aggregation Procedures for Network Design Problems
-
Front Matter
-
-
Approximate Second-Order Cone Robust Optimization
-
Front Matter
-
-
Back Matter
About this book
Authors and Affiliations
-
Dept. Mathe/Lehrstu. f. Wirtschaftsmathe, FAU Erlangen-Nürnberg, Erlangen, Germany
Andreas Bärmann
About the author
Bibliographic Information
Book Title: Solving Network Design Problems via Decomposition, Aggregation and Approximation
Authors: Andreas Bärmann
DOI: https://doi.org/10.1007/978-3-658-13913-1
Publisher: Springer Spektrum Wiesbaden
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer Fachmedien Wiesbaden 2016
Softcover ISBN: 978-3-658-13912-4Published: 10 June 2016
eBook ISBN: 978-3-658-13913-1Published: 02 June 2016
Edition Number: 1
Number of Pages: XV, 203
Number of Illustrations: 4 b/w illustrations, 28 illustrations in colour
Topics: Optimization, Operations Research/Decision Theory, Logistics