Online Minimization Knapsack Problem

DOI10.1007/978-3-642-12450-1_17zbMath1284.68680OpenAlexW1583926746MaRDI QIDQ3558925

Xin Han, Kazuhisa Makino

Publication date: 11 May 2010

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12450-1_17

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Related Items (11)

Online maximum matching with recourse ⋮ 2D knapsack: packing squares ⋮ Online removable knapsack with limited cuts ⋮ Online minimization knapsack problem ⋮ Online removable knapsack problem under convex function ⋮ Randomized algorithms for online knapsack problems ⋮ Online unweighted knapsack problem with removal cost ⋮ Online Maximum Matching with Recourse ⋮ 2D Knapsack: Packing Squares ⋮ Proportional Cost Buyback Problem with Weight Bounds ⋮ Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs

This page was built for publication: Online Minimization Knapsack Problem