scientific article; zbMATH DE number 7650243

DOI10.4230/LIPIcs.ISAAC.2019.10MaRDI QIDQ5875570

David Naori, Danny Raz

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1907.00605

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

generalized assignment problemknapsack problemsecretary problemrandom ordermultidimensional packing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

A note on the online interval scheduling secretary problem ⋮ Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints ⋮ Knapsack secretary through boosting

This page was built for publication: