On Bin Packing with Conflicts
From MaRDI portal
Publication:3395015
DOI10.1137/060666329zbMath1175.68200OpenAlexW2052059627MaRDI QIDQ3395015
Publication date: 20 August 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060666329
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (22)
An APTAS for bin packing with clique-graph conflicts ⋮ Online Bin Packing with Advice of Small Size ⋮ Semi-on-line bin packing: a short overview and a new lower bound ⋮ New models of graph-bin packing ⋮ Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ Batched bin packing revisited ⋮ THE GRAPH-BIN PACKING PROBLEM ⋮ The knapsack problem with forfeit sets ⋮ Security-aware database migration planning ⋮ A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem ⋮ Online variable-sized bin packing with conflicts ⋮ On-line bin packing with restricted repacking ⋮ On bin packing with clustering and bin packing with delays ⋮ Irreducible bin packing and normality in routing open shop ⋮ Lower bounds for several online variants of bin packing ⋮ More on batched bin packing ⋮ Quality of strong equilibria for selfish bin packing with uniform cost sharing ⋮ Online bin packing with advice of small size ⋮ Online results for black and white bin packing ⋮ Online bin packing with advice
This page was built for publication: On Bin Packing with Conflicts
