On the benchmark instances for the bin packing problem with conflicts

DOI10.1007/978-3-030-63072-0_14zbMath1481.90269arXiv1706.03526OpenAlexW3133870113MaRDI QIDQ2056901

Tiziano Bacci, Sara Nicoloso

Publication date: 8 December 2021

Full work available at URL: https://arxiv.org/abs/1706.03526

zbMATH Keywords

threshold graphsbin packing with conflictsrandom graph generator

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

On the benchmark instances for the bin packing problem with conflicts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bin packing and related problems: general arc-flow formulation with graph compression
• Solving vertex coloring problems as maximum weight stable set problems
• Approximation algorithms for time constrained scheduling
• New lower bounds for bin packing problems with conflicts
• A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts
• The min-conflict packing problem
• Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
• Heuristics and lower bounds for the bin packing problem with conflicts
• On the benchmark instances for the bin packing problem with conflicts
• Dual Inequalities for Stabilized Column Generation Revisited
• Column Generation based Primal Heuristics
• Algorithms for the Bin Packing Problem with Conflicts
• A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
• Heuristics for determining the number of warehouses for storing non-compatible products
• A Multi-start Tabu Search Based Algorithm for Solving the Warehousing Problem with Conflict

This page was built for publication: On the benchmark instances for the bin packing problem with conflicts