arXiv (All)
open access
A Group-Based Resource Allocation Model for the Fractional Knapsack Problem
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 ratio
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Simultaneous Ascending Bid Auctions with Budget Constraints#942251
- Inverse knapsack at two capacities: which pairs of value-cardinality hulls are realizable?#1064672
- Throttling Equilibria in Auction Markets#1142504
- Continuous auction models#1064189
- Resource Allocation with Karma Mechanisms#139077
Record · ID 998403
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive