scientific article; zbMATH DE number 7366679

DOI10.7540/J.YNU.20200102MaRDI QIDQ4996546zbMATH OpenFDO

Authors Hao Wang, Qinling Liu, Weidong Li

Publication date 1 July 2021

Full work available at URL https://doi.org/10.7540/J.YNU.20200102

zbMATH Keywords

approximation algorithmfair allocationgreedy algorithmiterative roundingknapsack problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Approximation algorithms for knapsack problems with cardinality constraints
• On a cardinality constrained linear programming knapsack problem
• The \(k\)-cardinality assignment problem
• scientific article; zbMATH DE number 2086929
• A polyhedral study of the cardinality constrained knapsack problem
• The k-Allocation Problem and Its Variants
• Approximate \#knapsack computations to count semi-fair allocations
• The Fair Resource Allocation Problem with Submodular Constraints
• Fair allocation algorithms for indivisible items under structured conflict constraints
• Computing knapsack solutions with cardinality robustness

Cited in

(2)

• Approximate \#knapsack computations to count semi-fair allocations
• Apportionments with minimum Gini index of disproportionality: a quadratic knapsack approach

This page was built for publication:

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