Power Grid Survivability Analysis / Najlacnejšie knihy
Power Grid Survivability Analysis

Code: 06838712

Power Grid Survivability Analysis

by Abhinav Verma

Given a power grid modeled by a network together with equations describing the power flows, power generation and consumption, and the laws of physics, the so-called N k problem asks whether there exists a set of k or fewer arcs wh ... more

68.81

RRP: 71.66 €

You save 2.85 €


Print on demand
Shipping in 17 - 27 days
Add to wishlist

You might also like

Give this book as a present today
  1. Order book and choose Gift Order.
  2. We will send you book gift voucher at once. You can give it out to anyone.
  3. Book will be send to donee, nothing more to care about.

Book gift voucher sampleRead more

More about Power Grid Survivability Analysis

You get 167 loyalty points

Book synopsis

Given a power grid modeled by a network together with equations describing the power flows, power generation and consumption, and the laws of physics, the so-called N k problem asks whether there exists a set of k or fewer arcs whose removal will cause the system to fail. More generally, we are interested in finding small vulnerabilities in the grid. In the first two parts of this work, we present theoretical and computational results involving a mixed-integer model and a continuous non- linear model related to this question. In the third part of this work, we consider the throughput maximization problem in a "lossless" power flow model. We consider both capacitated and uncapacitated networks, present efficient algorithms for the uncapacitated version and show that the capacitated version is NP-hard.

Book details

Book category Books in English Mathematics & science Mathematics

68.81

Trending among others



Collection points Bratislava a 12986 dalších

Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies


Account: Log in
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Shopping cart ( Empty )

For free shipping
shop for 59,99 € and more

You are here: