A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation

DOI10.1016/J.EJOR.2022.02.014MaRDI QIDQ2673554OpenAlexFDO

Authors Krzysztof Fleszar

Publication date 10 June 2022

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2022.02.014

zbMATH Keywords

heuristicspackingMILPfragmentationconflicts

Mathematics Subject Classification ID

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

Recommendations

• Bin packing problem with conflicts and item fragmentation
• Mathematical programming algorithms for bin packing problems with item fragmentation
• Column generation for the variable cost and size bin packing problem with fragmentation
• New formulations for variable cost and size bin packing problems with item fragmentation
• Heuristics for solving the bin-packing problem with conflicts

Cites work

• scientific article; zbMATH DE number 3643061 (Why is no real title available?)
• Algorithm 457: finding all cliques of an undirected graph
• Algorithms for the bin packing problem with conflicts
• An approximation scheme for bin packing with conflicts
• Approximation algorithms for combinatorial problems
• Approximation schemes for packing splittable items with cardinality constraints
• Approximation schemes for packing with item fragmentation
• Bin packing problem with conflicts and item fragmentation
• Branch-and-cut algorithms for the split delivery vehicle routing problem
• Complexity of fragmentable object bin packing and an application
• Exactly solving packing problems with fragmentation
• Heuristics and lower bounds for the bin packing problem with conflicts
• Heuristics for determining the number of warehouses for storing non-compatible products
• Listing all maximal cliques in large sparse real-world graphs
• Mathematical programming algorithms for bin packing problems with item fragmentation
• New formulations for variable cost and size bin packing problems with item fragmentation
• On cliques in graphs
• The worst-case time complexity for generating all maximal cliques and computational experiments

Cited in

(4)

• Bin packing problem with conflicts and item fragmentation
• Tighter bounds for the harmonic bin packing algorithm
• Fair allocation of indivisible items with conflict graphs
• The min-conflict packing problem

Describes a project that uses

Uses Software

• VRP
• Algorithm 457

This page was built for publication: A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation

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