Erratum for “Capital-Cost Minimization of Hydraulic Network”

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Genetic algorithm for network cost minimization using threshold based discounting

We present a genetic algorithm for heuristically solving a cost minimization problem applied to communication networks with threshold based discounting. The network model assumes that every two nodes can communicate and offers incentives to combine flow from different sources. Namely, there is a prescribed threshold on every link, and if the total flow on a link is greater than the threshold, t...

متن کامل

Erratum for “Resource Minimization Job Scheduling”

This note refers to the full version of the paper [2], available from the authors’ webpages. The mistake occurs in the proof of Claim 2. The algorithm rounds the solution of LP(T), where T is the time interval corresponding to the whole timeline. The linear program LP(T) is defined recursively, and uses solution values of linear programs LP(I) for intervals I that are strictly contained in T . ...

متن کامل

A particle swarm optimization algorithm for minimization analysis of cost-sensitive attack graphs

To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider cost-sensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There may be multiple countermeasures with different weights for preventing a single exploit. Also,...

متن کامل

Clustering for Edge-Cost Minimization

! "! #$ % & (') * "! & "! + ", ./ 0 1 2 3 "! 3 4 5 , 6. 71 8 " 9 "!

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Hydraulics Division

سال: 1973

ISSN: 0044-796X,2690-2524

DOI: 10.1061/jyceaj.0003763