Heuristics for solving the bin-packing problem with conflicts

MaRDI QIDQ2898516zbMATH OpenFDO

Authors 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

zbMATH Keywords

bin-packingmaximal cliqueconflicts graphmaximal-stablesubset

Mathematics Subject Classification ID

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

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

Cited in

(15)

• New lower bounds for bin packing problems with conflicts
• Heuristics and lower bounds for the bin packing problem with conflicts
• Homogeneous grouping of non-prime steel products for online auctions: a case study
• Algorithms for the two dimensional bin packing problem with partial conflicts
• On the benchmark instances for the bin packing problem with conflicts
• Algorithms for the bin packing problem with conflicts
• The min-conflict packing problem
• A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation
• Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
• Bin packing with directed stackability 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 DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
• A multi-start tabu search based algorithm for solving the warehousing problem with conflict

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)