Algorithms for the Bin Packing Problem with Conflicts
From MaRDI portal
Publication:2899071
DOI10.1287/ijoc.1090.0355zbMath1243.90189OpenAlexW2048947076MaRDI QIDQ2899071
Enrico Malaguti, Manuel Iori, Paolo Toth, Albert Einstein Fernandes Muritiba
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1090.0355
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (44)
Vehicle scheduling under the warehouse-on-wheels policy ⋮ Column Generation based Primal Heuristics ⋮ Fair Packing of Independent Sets ⋮ Algorithms for the two dimensional bin packing problem with partial conflicts ⋮ Set covering problem with conflict constraints ⋮ Procedures for the bin packing problem with precedence constraints ⋮ Bin packing and related problems: general arc-flow formulation with graph compression ⋮ Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ Exact algorithms for the bin packing problem with fragile objects ⋮ An exact algorithm for parallel machine scheduling with conflicts ⋮ Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation ⋮ Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows ⋮ A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation ⋮ Fair allocation algorithms for indivisible items under structured conflict constraints ⋮ VNS matheuristic for a bin packing problem with a color constraint ⋮ Minimum cost flow problem with conflicts ⋮ Lower and upper bounds for the bin packing problem with fragile objects ⋮ Bin Packing Problem with Time Lags ⋮ Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows ⋮ The knapsack problem with forfeit sets ⋮ Determining the Minimum Number of Warehouses and their Space-Size for Storing Compatible Items ⋮ A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph ⋮ A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal ⋮ A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts ⋮ Fair allocation of indivisible items with conflict graphs ⋮ The table placement problem: a research challenge at the EWI 2007 ⋮ A survey on vertex coloring problems ⋮ Irreducible bin packing and normality in routing open shop ⋮ Solving vertex coloring problems as maximum weight stable set problems ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ The min-conflict packing problem ⋮ Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts ⋮ Approximation of knapsack problems with conflict and forcing graphs ⋮ New lower bounds for bin packing problems with conflicts ⋮ Exact solution algorithms for the maximum flow problem with additional conflict constraints ⋮ Bin packing problem with conflicts and item fragmentation ⋮ A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts ⋮ Dual Inequalities for Stabilized Column Generation Revisited ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ On the benchmark instances for the bin packing problem with conflicts ⋮ The vertex coloring problem and its generalizations
This page was built for publication: Algorithms for the Bin Packing Problem with Conflicts
