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

vertex coloringbranch and pricebin packing with conflictslower bounds heuristics

Mathematics Subject Classification ID

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

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)

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

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)