Classification and evaluation of the algorithms for vector bin packing

DOI10.1016/J.COR.2024.106860MaRDI QIDQ6979024zbMATH OpenFDO

Authors Clément Mommessin, Thomas Erlebach, N. V. Shakhlevich

Publication date 26 May 2025

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106860

zbMATH Keywords

bin packingheuristicsvector bin packing

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A branch-and-bound algorithm for the two-dimensional vector packing problem
• A branch-and-price algorithm for the two-dimensional vector packing problem
• A Numerically Exact Algorithm for the Bin-Packing Problem
• An Application of Bin-Packing to Multiprocessor Scheduling
• Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
• Anomalous behavior in bin packing algorithms
• Approximation algorithms for combinatorial problems
• Approximation and online algorithms for multidimensional bin packing: a survey
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Bin packing and related problems: general arc-flow formulation with graph compression
• Bounds on Multiprocessing Timing Anomalies
• Counting and enumerating independent sets with applications to combinatorial optimization problems
• Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications
• Heuristics and lower bounds for the bin packing problem with conflicts
• scientific article; zbMATH DE number 6678949 (Why is no real title available?)
• scientific article; zbMATH DE number 3890754 (Why is no real title available?)
• scientific article; zbMATH DE number 6865614 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Lower bounds and algorithms for the 2-dimensional vector packing problem
• Multidimensional Bin Packing Algorithms
• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
• On Multidimensional Packing Problems
• Optimal analysis of best fit bin packing
• Resource allocation algorithms for virtualized service hosting platforms
• Resource constrained scheduling as generalized bin packing
• Solving bin packing problems using VRPSolver models
• Vector bin packing with heterogeneous bins: application to the machine reassignment problem
• Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem

Cited in

(4)

• Max-min and 1-bounded space algorithms for the bin packing problem
• Price-and-branch heuristic for vector bin packing
• Cost-sharing mechanisms for the selfish maximum open-end bin packing problem
• Max-min and 1-bounded space algorithms for the bin packing problem

This page was built for publication: Classification and evaluation of the algorithms for vector bin packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979024)