Solving Network Design Problems via Decomposition, Aggregation and Approximation

B�rmann, Andreas

ISBN 10: 3658139129 ISBN 13: 9783658139124

Editorial: Springer Spektrum, 2016

Nuevos Encuadernaci�n de tapa blanda

Librer�a: Best Price, Torrance, CA, Estados Unidos de America Calificaci�n del vendedor: 5 de 5 estrellas

Vendedor de AbeBooks desde 30 de agosto de 2024

Este art�culo en concreto ya no est� disponible.

Ver los art�culos de este vendedor Crear una petici�n para art�culos similares

Ver todos los ejemplares de este libro

Descripci�n

SUPER FAST SHIPPING. N� de ref. del art�culo 9783658139124

Denunciar este art�culo

Sinopsis:

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.

Acerca del autor: Dr. Andreas B�rmann is currently working as a postdoctoral researcher at the Friedrich-Alexander-Universit�t Erlangen-N�rnberg (FAU) at the chair of Economics, Discrete Optimization and Mathematics. His research is focussed on mathematical optimization, especially the optimization of logistic processes.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Detalles bibliogr�ficos

T�tulo: Solving Network Design Problems via ...
Editorial: Springer Spektrum
A�o de publicaci�n: 2016
Encuadernaci�n: Encuadernaci�n de tapa blanda
Condici�n: New

Los mejores resultados en AbeBooks

Imagen del vendedor

Solving Network Design Problems via Decomposition, Aggregation and Approximation

Andreas B�rmann

Publicado por Springer Fachmedien Wiesbaden, 2016

ISBN 10: 3658139129 ISBN 13: 9783658139124

Nuevo Tapa blanda

Impresi�n bajo demanda

Librería: moluna, Greven, Alemania

Calificaci�n del vendedor: 4 de 5 estrellas

Condici�n: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A Study in the Field of MathematicsDr. Andreas Baermann is currently working as a postdoctoral researcher at the Friedrich-Alexander-Universitaet Erlangen-Nuernberg (FAU) at the chair of Economics, Discrete Optimization and Mathematics. His research. N� de ref. del art�culo: 119492023

Contactar al vendedor

Comprar nuevo

EUR 48,37

Gastos de env�o: EUR 48,99

De Alemania a Estados Unidos de America

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen de archivo

Solving Network Design Problems via Decomposition, Aggregation and Approximation

B�rmann, Andreas

Publicado por Springer Spektrum, 2016

ISBN 10: 3658139129 ISBN 13: 9783658139124

Nuevo Tapa blanda

Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: New. N� de ref. del art�culo: ABLIING23Mar3113020246520

Contactar al vendedor

Comprar nuevo

EUR 52,87

Gastos de env�o: EUR 3,44

A Estados Unidos de America

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen del vendedor

Solving Network Design Problems via Decomposition, Aggregation and Approximation

Andreas B�rmann

Publicado por Springer Fachmedien Wiesbaden, 2016

ISBN 10: 3658139129 ISBN 13: 9783658139124

Nuevo Taschenbuch

Librería: AHA-BUCH GmbH, Einbeck, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Taschenbuch. Condici�n: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N� de ref. del art�culo: 9783658139124

Contactar al vendedor

Comprar nuevo

EUR 53,49

Gastos de env�o: EUR 61,89

De Alemania a Estados Unidos de America

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen del vendedor

Solving Network Design Problems via Decomposition, Aggregation and Approximation

Andreas B�rmann

Publicado por Springer Fachmedien Wiesbaden, Springer Fachmedien Wiesbaden Jun 2016, 2016

ISBN 10: 3658139129 ISBN 13: 9783658139124

Nuevo Taschenbuch

Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Taschenbuch. Condici�n: Neu. Neuware -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.Springer Spektrum in Springer Science + Business Media, Tiergartenstr. 15-17, 69121 Heidelberg 220 pp. Englisch. N� de ref. del art�culo: 9783658139124

Contactar al vendedor

Comprar nuevo

EUR 53,49

Gastos de env�o: EUR 60,00

De Alemania a Estados Unidos de America

Cantidad disponible: 2 disponibles

A�adir al carrito

Imagen del vendedor

Solving Network Design Problems via Decomposition, Aggregation and Approximation

Andreas B�rmann

Publicado por Springer Fachmedien Wiesbaden Jun 2016, 2016

ISBN 10: 3658139129 ISBN 13: 9783658139124

Nuevo Taschenbuch

Impresi�n bajo demanda

Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Taschenbuch. Condici�n: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 220 pp. Englisch. N� de ref. del art�culo: 9783658139124

Contactar al vendedor