On Bin Packing with Conflicts
From MaRDI portal
Publication:3395015
DOI10.1137/060666329zbMath1175.68200MaRDI 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
68Q25: Analysis of algorithms and problem complexity
90C27: Combinatorial optimization
68W25: Approximation algorithms
68W27: Online algorithms; streaming algorithms
Related Items
Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem, Lower bounds for several online variants of bin packing, 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, Online bin packing with advice, Semi-on-line bin packing: a short overview and a new lower bound, Online variable-sized bin packing with conflicts, An APTAS for bin packing with clique-graph conflicts, More on batched bin packing, Homogeneous grouping of non-prime steel products for online auctions: a case study, On bin packing with clustering and bin packing with delays, Irreducible bin packing and normality in routing open shop, 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, Batched bin packing revisited, On-line bin packing with restricted repacking, New models of graph-bin packing, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, THE GRAPH-BIN PACKING PROBLEM, Online Bin Packing with Advice of Small Size
