arXiv (All)
open access
Inclusion-wise extremal knapsack problems are (mostly) hard to approximate
We study two inclusion-wise extremal variants of the 0-1 Knapsack Problem (KP). Given $n$ items with integer weights and nonnegative costs or profits, the Minimum-Cost Maximal Knapsack Packing Problem seeks a minimum-cost packing for capacity $c$ to which no item can be added, while the Maximum-Prof
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
- Inverse knapsack at two capacities: which pairs of value-cardinality hulls are realizable?#1064672
- Improved opportunity cost algorithm for carrier selection in combinatorial auctions#489354
- A Fast Greedy Algorithm with a 0.45 Approximation Guarantee for the Airplane Refueling Problem#1326472
- Iterative Combinatorial Auctions#485660
- The tree packing conjecture for trees of almost linear maximum degree#986755
Record · ID 1343214
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