A computational study of approximation algorithms for a minmax resource allocation problem

MaRDI QIDQ5262858zbMATHFDO

Authors Bogusz Przybyslawski, Adam Kasperski

Publication date 16 July 2015

zbMATH Keywords

approximation algorithmsresource allocationrobust optimizationdiscrete optimization

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Semidefinite programming (90C22)

Recommendations

• A randomized algorithm for the min-Max selecting items problem with uncertain weights
• scientific article; zbMATH DE number 4149886
• Approximating the min-max (regret) selecting items problem
• An improved approximation algorithm for \textsc{Resource Allocation}
• Improved algorithm for resource allocation problems

Cited in

(11)

• scientific article; zbMATH DE number 4149886 (Why is no real title available?)
• POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
• scientific article; zbMATH DE number 5035881 (Why is no real title available?)
• A randomized algorithm for the min-Max selecting items problem with uncertain weights
• Faster min-max resource sharing in theory and practice
• An approximate solution to the linear problem of minimizing resource consumption
• Technical Note—On Min-Max Integer Allocation Problems
• Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
• A Max-Min Allocation Problem: Its Solutions and Applications
• Optimal resource allocation with minimum activation levels and fixed costs
• Approximation algorithms for constrained resource allocation

This page was built for publication: A computational study of approximation algorithms for a minmax resource allocation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262858)