arXiv (All)
open access
Robust Extensible Bin Packing and Revisiting a Convex Knapsack Problem
We study a robust extensible bin packing problem, under a budget uncertainty model where item sizes lie in the intersection of a box with a one-norm ball. We design an algorithm based on the column-and-constraint generation framework, which alternates between solving a master robust bin-packing prob
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
- Robust Extensible Bin Packing and a Convex Knapsack Problem#1120673
- Recent metaheuristics for the Weighted Set Covering problem#947620
- Which rectangle sets have perfect packings?#17192
- Cultural algorithms for the set covering problem#948550
- Eigenvalue-Decomposition Cost Denoising as an Alternative to Predict-then-Optimize for Shortest-Path Problems#1084995
Record · ID 1327281
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