On Bin Packing with Conflicts
From MaRDI portal
Publication:3395015
DOI10.1137/060666329zbMATH Open1175.68200OpenAlexW2052059627MaRDI QIDQ3395015FDOQ3395015
Authors: Leah Epstein, Asaf Levin 
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
Recommendations
Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cited In (32)
- Online bin packing with advice of small size
- Online results for black and white bin packing
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- Batched bin packing revisited
- Online bin packing with advice
- An APTAS for bin packing with clique-graph conflicts
- Semi-on-line bin packing: a short overview and a new lower bound
- An approximation scheme for bin packing with conflicts
- Online bin packing with advice of small size
- Security-aware database migration planning
- New lower bounds for bin packing problems with conflicts
- Online variable-sized bin packing with conflicts
- New models of graph-bin packing
- More on batched bin packing
- Lower bounds for several online variants of bin packing
- Irreducible bin packing and normality in routing open shop
- Two-dimensional packing with conflicts
- Homogeneous grouping of non-prime steel products for online auctions: a case study
- An approximation scheme for bin packing with conflicts
- On Bin Packing with Conflicts
- On the benchmark instances for the bin packing problem with conflicts
- Algorithms for the bin packing problem with conflicts
- On bin packing with clustering and bin packing with delays
- The graph-bin packing problem
- Approximating Bin Packing with Conflict Graphs via Maximization Techniques
- Bin packing with directed stackability conflicts
- The knapsack problem with forfeit sets
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- On-line bin packing with restricted repacking
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
- Multi-dimensional Packing with Conflicts
This page was built for publication: On Bin Packing with Conflicts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395015)
