Order Total (1 Item Items):
Shipping Destination:
Solving Network Design Problems by Bärmann Andreas (15 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (15)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (13)
- As New, Fine or Near Fine (2)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (15)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (9)
- Not Print on Demand (11)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50 (No further results match this refinement)
- Over US$ 50
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
-
-
Condition: As New. Unread book in perfect condition.
-
Solving Network Design Problems via Decomposition, Aggregation and Approximation
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 68.88
US$ 15.77 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Solving Network Design Problems Via Decomposition, Aggregation and Approximation
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 68.12
US$ 19.74 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New. pp. 192.
-
Solving Network Design Problems Via Decomposition, Aggregation and Approximation
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 75.62
US$ 19.74 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Solving Network Design Problems Via Decomposition, Aggregation and Approximation
Published by Spektrum Akademischer Verlag Gmbh, 2016
ISBN 10: 3658139129 ISBN 13: 9783658139124
Language: English
Paperback. Condition: Brand New. 220 pages. 9.44x6.61x0.55 inches. In Stock.
-
Solving Network Design Problems via Decomposition, Aggregation and Approximation
Published by Springer Fachmedien Wiesbaden, Springer Fachmedien Wiesbaden Jun 2016, 2016
ISBN 10: 3658139129 ISBN 13: 9783658139124
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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.
-
Solving Network Design Problems via Decomposition, Aggregation and Approximation
Published by Springer Fachmedien Wiesbaden, 2016
ISBN 10: 3658139129 ISBN 13: 9783658139124
Language: English
Taschenbuch. Condition: 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.
-
Solving Network Design Problems via Decomposition, Aggregation and Approximation
Published by Springer Fachmedien Wiesbaden, 2016
ISBN 10: 3658139129 ISBN 13: 9783658139124
Language: English
Taschenbuch. Condition: Neu. Solving Network Design Problems via Decomposition, Aggregation and Approximation | Andreas Bärmann | Taschenbuch | xv | Englisch | 2016 | Springer Fachmedien Wiesbaden | EAN 9783658139124 | Verantwortliche Person für die EU: Springer Spektrum in Springer Science + Business Media, Tiergartenstr. 15-17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Solving Network Design Problems via Decomposition, Aggregation and Approximation
Published by Springer Fachmedien Wiesbaden Jun 2016, 2016
ISBN 10: 3658139129 ISBN 13: 9783658139124
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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.
-
Condition: New. Print on Demand pp. 192.
-
Condition: New. PRINT ON DEMAND pp. 192.
-
Solving Network Design Problems via Decomposition, Aggregation and Approximation
Published by Springer Fachmedien Wiesbaden, 2016
ISBN 10: 3658139129 ISBN 13: 9783658139124
Language: English
Condition: 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.
