On data reduction for dynamic vector bin packing

DOI10.1016/j.orl.2023.06.005zbMath1525.90376arXiv2205.08769MaRDI QIDQ6047700

Pavel V. Smirnov, O. Yu. Tsidulko, René van Bevern, Andrey Melnikov

Publication date: 12 September 2023

Published in: Operations Research Letters (Search for Journal in Brave)

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

zbMATH Keywords

resource allocationparameterized complexitylossy kernelizationapproximation \& heuristics

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU

Cites Work

• Unnamed Item
• There is no asymptotic PTAS for two-dimensional vector packing
• Parameterizing by the number of numbers
• Interval scheduling and colorful independent sets
• A branch-and-price algorithm for the temporal bin packing problem
• Approximation and online algorithms for multidimensional bin packing: a survey
• Parametrized complexity theory.
• Integer Programming with a Fixed Number of Variables
• Presolve Reductions in Mixed Integer Programming
• Dynamic Bin Packing
• Minkowski's Convex Body Theorem and Integer Programming
• Improved Approximation for Vector Bin Packing
• Kernelization
• Lossy kernelization
• Kernelization Lower Bounds by Cross-Composition

This page was built for publication: On data reduction for dynamic vector bin packing