Fair-Canal-Delivery: lexicographic max-min water delivery under deadline and capacity limits
Annotatsiya
A reproducibility package for a study of fair water delivery on an irrigation canal. Fairness is measured on the volume a user actually receives inside an agreed delivery window rather than on the volume that was scheduled: orders are reshaped before the low-pass filter that damps wave dynamics, and the worst-off delivered fraction is maximised lexicographically under the canal dynamics, gate saturation and reach capacities. An order that cannot be met returns an infeasibility certificate rather than an optimistic schedule. The package contains the library, the computation scripts, the complete result archive with its provenance record, the figures and tables the article reports, and a desktop viewer that shows every number beside the file it came from. Superseded by version 0.2.1, https://doi.org/10.5281/zenodo.22773437. The file attached to this version is a download of the repository's main branch, not the archive built from the v0.2.0 tag that its own README describes, so the checksum published in that README does not match the file here. The code and the results are those of 0.2.1; cite 0.2.1.
Hali tarjima qilinmagan