A solution method for the non-additive resource allocation problem in distributed system design

DOI10.1016/0020-0190(82)90100-4zbMath0514.68086OpenAlexW2022243853MaRDI QIDQ1051443

Stefano Ceri, G. Pelagatti

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90100-4

zbMATH Keywords

allocation problemcapacity networkdistributed information systemsmin cut - max flow problem

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (1)

An adaptive mixed relation decomposition algorithm for conjunctive retrieval queries

Cites Work

• Unnamed Item
• Unnamed Item
• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Optimal program and data locations in computer networks
• Notes—On a Selection Problem

This page was built for publication: A solution method for the non-additive resource allocation problem in distributed system design