Buy Mathematical Optimization for Efficient and Robust Energy Networks
Home > Business & Economics > Industry & industrial studies > Energy industries & utilities > Coal & solid fuel industries > Mathematical Optimization for Efficient and Robust Energy Networks
Mathematical Optimization for Efficient and Robust Energy Networks

Mathematical Optimization for Efficient and Robust Energy Networks


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
About the Book

This book presents a collection of energy production and distribution problems identified by the members of the COST Action TD1207 "Mathematical Optimization in the Decision Support Systems for Efficient and Robust Energy Networks". The aim of the COST Action was to coordinate the efforts of the experts in different fields, from academia and industry, in developing innovative tools for quantitative decision making, and apply them to the efficient and robust design and management of energy networks. The work covers three main goals: - to be a nimble while comprehensive resource of several real life business problems with a categorized set of pointers to many relevant prescriptive problems for energy systems;- to offer a balanced mix of scientific and industrial views;- to evolve over time in a flexible and dynamic way giving, from time to time, a more scientific or industrial - or even political in a broad sense - weighed perspective.It is addressed to researchers and professionals working in the field.
About the Author:

Natalia Selini Hadjidimitriou is researcher at the Department of Sciences and Methods for Engineering (DISMI) at University of Modena and Reggio Emilia. She has a degree in Statistics and economics obtained in 2005 and a PhD in Automatic and Operational Research obtained in 2015 at University of Bologna. Her research activities focus on data analytics techniques for the transport and energy sectors. She teaches data science and she has coordinated several EU projects activities.

Antonio Frangioni is Full Professor at the Department of Computer Science of the University of Pisa. His main research interest are the analysis, implementation and testing of solution approaches for problems at the interface between continuous and combinatorial optimization, and their real-life application to several fields (energy, logistic, telecommunications, ...). He is also interested in the numerical analysis, computer science, artificial intelligence and machine learning issues arising within these approaches and, vice-versa, in the use of mathematical programming techniques in those disciplines. He has co-ordinated several scientific and applied projects, among which being vice-chair of the COST Action TD1207.

Andrea Lodi is a full professor in the Department of Mathematical and Industrial Engineering at Polytechnique Montréal and holds the Canada Excellence Research Chair in Data Science for Real-Time Decision-Making. His research interests are mixed-integer linear and nonlinear programming and data science. He received several awards including the IBM Herman Goldstine Fellowship, the Google Faculty Research award and the IBM Faculty Award. He has been network coordinator and principal investigator of both EU and Canadian projects/networks, among which the the COST Action TD1207; since 2006, he is consultant of the IBM CPLEX research and development team.

Thorsten Koch is Professor for Software and Algorithms for Discrete Optimization at TU-Berlin and head of the Applied Algorithmic Intelligence Methods department at the Zuse Institute Berlin. His areas of work include Integer Programming and planning of large-scale infrastructure networks. He coordinated the FORNE project, which received the 2016 EURO Excellence in Practice Award of the European OR Society. Until 2019 he was head of the GasLab and the SynergyLab within the Research Campus MODAL (Mathematical Optimization and Data Analysis Laboratory). He has been chair of the COST Action TD1207.


Best Sellers



Product Details
  • ISBN-13: 9783030574413
  • Publisher: Springer International Publishing
  • Publisher Imprint: Springer
  • Height: 239 mm
  • No of Pages: 131
  • Series Title: Airo Springer
  • Weight: 412 gr
  • ISBN-10: 3030574415
  • Publisher Date: 08 May 2021
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Spine Width: 13 mm
  • Width: 196 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Mathematical Optimization for Efficient and Robust Energy Networks
Springer International Publishing -
Mathematical Optimization for Efficient and Robust Energy Networks
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Mathematical Optimization for Efficient and Robust Energy Networks

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!