k-times bin-packing reduces fair electricity division to a finite-k packing problem, with generalized First-Fit algorithms outperforming heuristics on real demand data for egalitarian time allocation.
Proceedings of the Amer- ican Mathematical Society16(3), 548–550 (1965)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Time and Supply Fairness in Electricity Distribution using $k$-times bin packing
k-times bin-packing reduces fair electricity division to a finite-k packing problem, with generalized First-Fit algorithms outperforming heuristics on real demand data for egalitarian time allocation.