Heuristics for solving the bin-packing problem with conflicts

zbMATH Open1242.90302MaRDI QIDQ2898516FDOQ2898516

Mohamed Maiza, Mohammed Said Radjef

Publication date: 11 July 2012

Published in: Applied Mathematical Sciences (Ruse) (Search for Journal in Brave)

Full work available at URL: http://www.m-hikari.com/ams/ams-2011/ams-33-36-2011/index.html

Recommendations

• Heuristics and lower bounds for the bin packing problem with conflicts
• Algorithms for the bin packing problem with conflicts
• The min-conflict packing problem
• On the benchmark instances for the bin packing problem with conflicts
• An approximation scheme for bin packing with conflicts

zbMATH Keywords

bin-packingmaximal cliqueconflicts graphmaximal-stablesubset

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited In (10)

• Heuristics and lower bounds for the bin packing problem with conflicts
• Homogeneous grouping of non-prime steel products for online auctions: a case study
• On the benchmark instances for the bin packing problem with conflicts
• A Multi-start Tabu Search Based Algorithm for Solving the Warehousing Problem with Conflict
• Algorithms for the bin packing problem with conflicts
• Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
• A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts

This page was built for publication: Heuristics for solving the bin-packing problem with conflicts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898516)