On Bin Packing with Conflicts

DOI10.1137/060666329MaRDI QIDQ3395015zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

online algorithmsapproximation algorithmsbin packing

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• On Bin Packing with Conflicts
• An approximation scheme for bin packing with conflicts
• An approximation scheme for bin packing with conflicts
• Online variable-sized bin packing with conflicts
• Two-dimensional packing with conflicts

Cited in

(31)

• Multi-dimensional Packing with Conflicts
• 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
• Online bin packing with advice
• Batched bin packing revisited
• Semi-on-line bin packing: a short overview and a new lower bound
• An APTAS for bin packing with clique-graph conflicts
• An approximation scheme for bin packing with conflicts
• Online bin packing with advice of small size
• New lower bounds for bin packing problems with conflicts
• Online variable-sized bin packing with conflicts
• Security-aware database migration planning
• New models of graph-bin packing
• More on batched 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 the benchmark instances for the bin packing problem with conflicts
• On Bin Packing 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 evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• The knapsack problem with forfeit sets
• 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

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)