On Bin Packing with Conflicts
From MaRDI portal
Publication:5443517
DOI10.1007/11970125_13zbMath1129.68586OpenAlexW1512762491MaRDI QIDQ5443517
Publication date: 21 February 2008
Full work available at URL: https://doi.org/10.1007/11970125_13
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (9)
Scheduling with conflicts: Online and offline algorithms ⋮ Bin packing with ``largest in bottom constraint: tighter bounds and generalizations ⋮ Two-dimensional packing with conflicts ⋮ Approximability of the subset sum reconfiguration problem ⋮ Approximability of the Subset Sum Reconfiguration Problem ⋮ Approximation of the \(k\)-batch consolidation problem ⋮ Robustly assigning unstable items ⋮ Analysis of a first-fit algorithm for the capacitated unit covering problem ⋮ On capacitated covering with unit balls
This page was built for publication: On Bin Packing with Conflicts
