Resource allocation under limited sharing
From MaRDI portal
Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Analysis of a Compound Bin Packing Algorithm
- On finding optimal and near-optimal lineal spanning trees
- Resource allocation under limited sharing
- Variable Sized Bin Packing
Cited in
(11)- Sharing a resource with randomly arriving foragers
- The equal share proportional solution in a permit sharing problem
- Resource allocation under limited sharing
- Incentive ratios of a proportional sharing mechanism in resource sharing
- scientific article; zbMATH DE number 1756092 (Why is no real title available?)
- scientific article; zbMATH DE number 1908216 (Why is no real title available?)
- Ergodicity of one-dimensional resource sharing systems.
- scientific article; zbMATH DE number 5823977 (Why is no real title available?)
- A foundation of demand-side resource management in distributed systems
- Sharing-group allocation problems
- Engineering Self-Organising Systems
This page was built for publication: Resource allocation under limited sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750312)