Online variable-sized bin packing with conflicts
From MaRDI portal
Publication:429693
DOI10.1016/j.disopt.2010.11.001zbMath1241.90106OpenAlexW2021844871MaRDI QIDQ429693
Asaf Levin, Leah Epstein, Lene Monrad Favrholdt
Publication date: 20 June 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2010.11.001
Related Items
New models of graph-bin packing ⋮ Parameterized complexity of conflict-free matchings and paths ⋮ An iterated greedy algorithm for the planning of yarn‐dyeing boilers ⋮ 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 ⋮ Tight Bounds for Restricted Grid Scheduling ⋮ Exploring the Kernelization Borders for Hitting Cycles ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Conflict free version of covering problems on graphs: classical and parameterized ⋮ Parameterized complexity of conflict-free set cover ⋮ A unifying model for locally constrained spanning tree problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric packing of selfish items and the subset sum algorithm
- A new version of on-line variable-sized bin packing
- Approximation algorithms for time constrained scheduling
- Scheduling jobs on grid processors
- Geometric algorithms and combinatorial optimization.
- Worst-case analysis of the subset sum algorithm for bin packing.
- Fast algorithms for bin packing
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- An approximation scheme for bin packing with conflicts
- On Bin Packing with Conflicts
