No AI summary available for this article.
Why It Matters
To solve the fractional knapsack problem, Dantzig's greedy rule orders items according to their value-to-cost ratio.
Provenance
Discovered via ArXiv and published by ArXiv.
Key Claims
Original description
To solve the fractional knapsack problem, Dantzig's greedy rule orders items according to their value-to-cost ratio. This ordering introduces priority issues. An arbitrarily small perturbation to the input can change the allocation if the budget is exhausted between two items with very similar ratios. To mitigate that problem, we introduce a two-stage rule. We group items sharing attributes within a radius $δ$. These groups are then evaluated in descending order of ratio, and divide their group's budget share without further ranking. Consider a group featuring an aggregate capacity $U_G$, unit...
Discovered via ArXiv
Research papers and preprints from arXiv.
Publisher: arxiv.org
ID: http://arxiv.org/abs/2609.06470v1 · Indexed 4 days ago