Fujishige, Satoru; Katoh, Naoki; Ichimori, Tetsuo The fair resource allocation problem with submodular constraints. (English) Zbl 0647.90063 Math. Oper. Res. 13, No. 1, 164-173 (1988). The problem of allocating a limited resource to relevant activities in a fair manner is generalized to one with a feasible set expressd by a submodular function. The algorithm for the corresponding integer problem, proposed in the paper has the same computational complexity as that of the earlier considered algorithm by N. Katoh, T. Ibaraki and H. Mine [ibid. 10, No.1, 44-53 (1985; Zbl 0564.90038)], but is simpler. Reviewer: J.Mitev Cited in 4 Documents MSC: 90C10 Integer programming 68Q25 Analysis of algorithms and problem complexity Keywords:fair resource allocation; submodular constraints; submodular function; computational complexity Citations:Zbl 0564.90038 PDFBibTeX XMLCite \textit{S. Fujishige} et al., Math. Oper. Res. 13, No. 1, 164--173 (1988; Zbl 0647.90063) Full Text: DOI