Online variable-sized bin packing with conflicts
From MaRDI portal
Publication:429693
DOI10.1016/J.DISOPT.2010.11.001zbMATH Open1241.90106OpenAlexW2021844871MaRDI QIDQ429693FDOQ429693
Authors: Leah Epstein, Asaf Levin, Lene M. 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization.
- Worst-case analysis of the subset sum algorithm for bin packing.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Parametric packing of selfish items and the subset sum algorithm
- On Bin Packing with Conflicts
- Title not available (Why is that?)
- Fast algorithms for bin packing
- Title not available (Why is that?)
- An approximation scheme for bin packing with conflicts
- Approximation algorithms for time constrained scheduling
- A new version of on-line variable-sized bin packing
- Scheduling jobs on grid processors
Cited In (20)
- Parameterized complexity of conflict-free matchings and paths
- Scheduling Jobs on Grid Processors
- Title not available (Why is that?)
- Conflict free version of covering problems on graphs: classical and parameterized
- Solving the set covering problem with conflicts on sets: a new parallel GRASP
- Security-aware database migration planning
- Title not available (Why is that?)
- New models of graph-bin packing
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers
- Parameterized complexity of conflict-free set cover
- Online variable-sized bin packing
- Online bin packing with arbitrary release times
- On Bin Packing with Conflicts
- Exploring the kernelization borders for hitting cycles
- A unifying model for locally constrained spanning tree problems
- Tight bounds for restricted grid scheduling
- On Bin Packing with Conflicts
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
- Title not available (Why is that?)
This page was built for publication: Online variable-sized bin packing with conflicts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429693)
