Von dem Buch Solving Network Design Problems via Decomposition Aggregation and Approximation haben wir 2 gleiche oder sehr ähnliche Ausgaben identifiziert!
Falls Sie nur an einem bestimmten Exempar interessiert sind, können Sie aus der folgenden Liste jenes wählen, an dem Sie interessiert sind:
100%: Andreas Bärmann: Solving Network Design Problems via Decomposition Aggregation and Approximation (ISBN: 9783658139131) 2016, in Englisch, Taschenbuch.Nur diese Ausgabe anzeigen…
100%: Bärmann, Andreas: Solving Network Design Problems Via Decomposition, Aggregation and Approximation (ISBN: 9783658139124) 2016, in Deutsch, Taschenbuch.Nur diese Ausgabe anzeigen…
Solving Network Design Problems via Decomposition Aggregation and Approximation
13 Angebote vergleichen
| Preise | Juli 16 | März 19 | Okt. 19 |
|---|---|---|---|
| Schnitt | Fr. 56.46 (€ 57.69)¹ | Fr. 51.09 (€ 52.20)¹ | Fr. 52.52 (€ 53.67)¹ |
| Nachfrage |
1
Solving Network Design Problems via Decomposition, Aggregation and Approximation
DE NW EB DLISBN: 9783658139131 bzw. 3658139137, in Deutsch, Springer Shop, neu, E-Book, elektronischer Download.
Lieferung aus: Japan, Lagernd, zzgl. Versandkosten.
Andreas Bärmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time. eBook.
Andreas Bärmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time. eBook.
2
Solving Network Design Problems via Decomposition, Aggregation and Approximation
DE NW EB DLISBN: 9783658139131 bzw. 3658139137, in Deutsch, Springer Fachmedien Wiesbaden Gmbh, neu, E-Book, elektronischer Download.
Lieferung aus: Deutschland, Versandkostenfrei.
Solving Network Design Problems via Decomposition, Aggregation and Approximation: Andreas B?rmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time. Englisch, Ebook.
Solving Network Design Problems via Decomposition, Aggregation and Approximation: Andreas B?rmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time. Englisch, Ebook.
3
Solving Network Design Problems via Decomposition, Aggregation and Approximation
~EN NW EB DLISBN: 9783658139131 bzw. 3658139137, vermutlich in Englisch, Springer Fachmedien Wiesbaden Gmbh, neu, E-Book, elektronischer Download.
Lieferung aus: Deutschland, Versandkostenfrei.
Solving Network Design Problems via Decomposition, Aggregation and Approximation: Andreas Bärmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time. Englisch, Ebook.
Solving Network Design Problems via Decomposition, Aggregation and Approximation: Andreas Bärmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time. Englisch, Ebook.
4
Solving Network Design Problems via Decomposition, Aggregation and Approximation (2016)
DE PB NWISBN: 9783658139131 bzw. 3658139137, in Deutsch, Springer Fachmedien Wiesbaden, Taschenbuch, neu.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
6
Solving Network Design Problems via Decomposition Aggregation and Approximation
~EN PB NW EB DLISBN: 9783658139131 bzw. 3658139137, vermutlich in Englisch, Springer-Verlag GmbH, Taschenbuch, neu, E-Book, elektronischer Download.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
7
Symbolbild
Solving Network Design Problems Via Decomposition, Aggregation and Approximation (2016)
DE PB NWISBN: 9783658139124 bzw. 3658139129, in Deutsch, Spektrum Akademischer Verlag Gmbh, Taschenbuch, neu.
Von Händler/Antiquariat, Revaluation Books [2134736], Exeter, United Kingdom.
9.44x6.61 inches. In Stock.
9.44x6.61 inches. In Stock.
8
Symbolbild
Solving Network Design Problems via Decomposition, Aggregation and Approximation (2016)
DE NW RPISBN: 9783658139124 bzw. 3658139129, in Deutsch, Springer Fachmedien Wiesbaden, neu, Nachdruck.
Von Händler/Antiquariat, Books2Anywhere [190245], Fairford, GLOS, United Kingdom.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
9
Symbolbild
Solving Network Design Problems via Decomposition, Aggregation and Approximation (2016)
DE NW RPISBN: 9783658139124 bzw. 3658139129, in Deutsch, Springer Fachmedien Wiesbaden, neu, Nachdruck.
Von Händler/Antiquariat, PBShop [61989342], Secaucus, NJ, U.S.A.
New Book.Shipped from US within 10 to 14 business days.THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
New Book.Shipped from US within 10 to 14 business days.THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Lade…