Online variable-sized bin packing with conflicts

DOI10.1016/J.DISOPT.2010.11.001MaRDI QIDQ429693zbMATHOpenAlexFDO

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

zbMATH Keywords

online algorithmsbin packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Scheduling Jobs on Grid Processors
• Scheduling jobs on grid processors
• On Bin Packing with Conflicts
• On Bin Packing with Conflicts
• Algorithms for the bin packing problem with conflicts

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3890754 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• A new version of on-line variable-sized bin packing
• An approximation scheme for bin packing with conflicts
• Approximation algorithms for time constrained scheduling
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Fast algorithms for bin packing
• Geometric algorithms and combinatorial optimization.
• On Bin Packing with Conflicts
• Parametric packing of selfish items and the subset sum algorithm
• Scheduling jobs on grid processors
• Worst-case analysis of the subset sum algorithm for bin packing.

Cited in

(20)

• Parameterized complexity of conflict-free matchings and paths
• A unifying model for locally constrained spanning tree problems
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
• Tight bounds for restricted grid scheduling
• Parameterized complexity of conflict-free matchings and paths
• Exploring the kernelization borders for hitting cycles
• Scheduling Jobs on Grid Processors
• scientific article; zbMATH DE number 7559382 (Why is no real title available?)
• An iterated greedy algorithm for the planning of yarn‐dyeing boilers
• Parameterized complexity of conflict-free set cover
• scientific article; zbMATH DE number 5761817 (Why is no real title available?)
• Conflict free version of covering problems on graphs: classical and parameterized
• Online variable-sized bin packing
• Solving the set covering problem with conflicts on sets: a new parallel GRASP
• On Bin Packing with Conflicts
• Security-aware database migration planning
• Online bin packing with arbitrary release times
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• New models of graph-bin packing
• On Bin Packing with Conflicts

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)