Skip to main content
  • 506 Accesses

Abstract

Three highly topical questions on the practical solution of network design problems have been posed at the beginning of this thesis and have been the motivation for an extensive study of algorithms to treat large-scale instances. Three different problem variants have been subject to investigation, each of them with its own intrinsic challenges. And in all three cases we have been able to find answers allowing to make important steps towards efficient solution strategies, spanning the whole range from exact over heuristic to approximative approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andreas Bärmann .

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Fachmedien Wiesbaden

About this chapter

Cite this chapter

Bärmann, A. (2016). Conclusions and Outlook. In: Solving Network Design Problems via Decomposition, Aggregation and Approximation . Springer Spektrum, Wiesbaden. https://doi.org/10.1007/978-3-658-13913-1_14

Download citation

Publish with us

Policies and ethics