Algorithms for the bin packing problem with conflicts

DOI10.1287/IJOC.1090.0355MaRDI QIDQ2899071zbMATH OpenOpenAlexFDO

Authors Manuel Iori, Enrico Malaguti, Paolo Toth, Albert E. 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

zbMATH Keywords

bin packing with conflictsbranch and pricelower bounds heuristicsvertex coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Integer programming (90C10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Heuristics for solving the bin-packing problem with conflicts
• Algorithms for the two dimensional bin packing problem with partial conflicts
• On Bin Packing with Conflicts
• On Bin Packing with Conflicts
• An approximation scheme for bin packing with conflicts
• An approximation scheme for bin packing with conflicts
• A branch-and-price algorithm for the bin packing problem with conflicts
• Heuristics and lower bounds for the bin packing problem with conflicts
• scientific article; zbMATH DE number 3970110
• On the benchmark instances for the bin packing problem with conflicts

Cited in

(59)

• The vertex coloring problem and its generalizations
• Exact algorithms for the bin packing problem with fragile objects
• VNS matheuristic for a bin packing problem with a color constraint
• 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
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
• 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
• An approximation scheme for bin packing with conflicts
• Approximation of knapsack problems with conflict and forcing graphs
• 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
• On the benchmark instances for the bin packing problem with conflicts
• Algorithm NextFit for the bin packing problem
• Set covering problem with conflict constraints
• Homogeneous grouping of non-prime steel products for online auctions: a case study
• Irreducible bin packing and normality in routing open shop
• Zero duality gap in surrogate constraint optimization: a concise review of models
• Assignment problem with conflicts
• An exact algorithm for parallel machine scheduling with conflicts
• Vehicle scheduling under the warehouse-on-wheels policy
• A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• Fair allocation of indivisible items with conflict graphs
• Dual inequalities for stabilized column generation revisited
• Column generation based primal heuristics
• Algorithms for the two dimensional bin packing problem with partial conflicts
• Heuristics for solving the bin-packing problem with conflicts
• A branch-and-price algorithm for the bin packing problem with conflicts
• Bin packing with colocations
• A survey on vertex coloring problems
• Procedures for the bin packing problem with precedence constraints
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
• Bin packing and related problems: general arc-flow formulation with graph compression
• Lower and upper bounds for the bin packing problem with fragile objects
• Online variable-sized bin packing with conflicts
• The table placement problem: a research challenge at the EWI 2007
• 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
• The bin packing problem with precedence constraints
• Fair Packing of Independent Sets
• Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation
• Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows
• Bin Packing Problem with Time Lags
• Solving vertex coloring problems as maximum weight stable set problems
• A multi-start tabu search based algorithm for solving the warehousing problem with conflict
• Bin packing with directed stackability conflicts
• Fair allocation algorithms for indivisible items under structured conflict constraints
• Minimum cost flow problem with conflicts
• Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
• The knapsack problem with forfeit sets
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
• Improved approximation algorithms for bin packing with conflicts
• Fixed set search matheuristic applied to the knapsack problem with forfeits
• Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation
• Random-key optimizer and linearization for the quadratic multiple constraints variable-sized bin packing problem
• New lower bounds for bin packing problems with conflicts

This page was built for publication: Algorithms for 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 Q2899071)