Nesa Ilich
University of Calgary
22 Papers
131 Citations
Nesa Ilich is an academic researcher from University of Calgary. The author has contributed to research in topics: Series (mathematics) & Flow network. The author has an hindex of 10, co-authored 18 publications.
Chat about Author
Papers
Shortcomings of linear programming in optimizing river basin allocation
TL;DR: In this paper, the authors demonstrate one possible failure to solve a simple allocation problem using the NFA-based model and shows how this problem can be solved using the standard LP approach.
29
Nine Hundred Years of Weekly Streamflows: Stochastic Downscaling of Ensemble Tree-Ring Reconstructions
David J. Sauchyn,Nesa Ilich +1 more
TL;DR: In this paper, the authors combined the methods and advantages of stochastic and paleo-hydrology to estimate 900 years of weekly flows for the North and South Saskatchewan Rivers at Edmonton and Medicine Hat, Alberta, respectively.
28
A simple method for effective multi-site generation of stochastic hydrologic time series
Nesa Ilich,Jovan Despotović +1 more
TL;DR: In this article, the authors present an algorithm for generating stationary stochastic hydrologic time series at multiple sites, which relies on the recent advances in statistical science for simulating random variables with arbitrary marginal distributions and a given covariance structure, and on an approach for reordering the generated sub-sets of each synthetic year of data such that the annual auto-correlation of desired lag is maintained, along with the autocorrelations between the end of the preceding year and the beginning of the current year.
21
Limitations of network flow algorithms in river basin modeling.
TL;DR: This paper critically examines the notion that iterations applied in combination with NFA are a good vehicle for handling nonnetwork constraints and demonstrates the failures on several variants of a simple problem with two reservoirs in series.
20
Evolutionary Algorithm for Minimization of Pumping Cost
Nesa Ilich,Slobodan P. Simonovic +1 more
TL;DR: The proposed method provides promising improvements in terms of optimality when compared to the widespread gradient search methods because it does not involve evaluation of the gradient of the objective function.
18