Conceptio › Archive › HAL (France)
HAL (France)open access

Robust Extensible Bin Packing and a Convex Knapsack Problem

Noam Goldberg et al.
HAL (France) · Papers · License: Open Access
Open Source ↗
Robust bin packing, Extensible bin packing, 0, FP-TAS, Convex knapsack, 1, Dynamic programming
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 1120673
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.