Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation

DOI10.1287/IJOC.2021.1120OpenAlexW4200072569MaRDI QIDQ5086008FDOQ5086008

Authors:

Publication date: 30 June 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2021.1120

Recommendations

• Binary decision diagrams for bin packing with minimum color fragmentation
• The Co-Printing Problem: A Packing Problem with a Color Constraint
• Column generation for the variable cost and size bin packing problem with fragmentation
• A branch-and-price algorithm for the bin packing problem with conflicts
• Bin packing problem with conflicts and item fragmentation

zbMATH Keywords

integer programmingbin packingbranch-and-pricedecision diagrams

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Scikit-learn: machine learning in Python
• Graph-Based Algorithms for Boolean Function Manipulation
• Heuristics and lower bounds for the bin packing problem with conflicts
• Algorithms for the bin packing problem with conflicts
• Exact solution of bin-packing problems using column generation and branch-and-bound
• `` Strong NP-Completeness Results
• Computational study of a column generation algorithm for bin packing and cutting stock problems
• A set-covering-based heuristic approach for bin-packing problems
• Exact solution of graph coloring problems via constraint programming and column generation
• Bin packing and related problems: general arc-flow formulation with graph compression
• Title not available (Why is that?)
• The bin packing problem with precedence constraints
• Lower bounds and reduction procedures for the bin packing problem
• An MDD approach to multidimensional bin packing
• A dynamic programming algorithm for the knapsack problem with setup
• Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
• A branch-and-price algorithm for the bin packing problem with conflicts
• Certificates of primal or dual infeasibility in linear programming
• Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes
• Combinatorial Benders' cuts for the strip packing problem
• Decomposition based on decision diagrams
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
• A constraint-programming-based branch-and-price-and-cut approach for operating room planning and scheduling
• Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
• Improved dynamic programming and approximation results for the knapsack problem with setups
• A \(O(n\log ^2 n)\) checker and \(O(n^2\log n)\) filtering algorithm for the energetic reasoning
• Exact approaches for the knapsack problem with setups
• The Co-Printing Problem: A Packing Problem with a Color Constraint
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
• Dynamic programming and optimal control. Vol. 1.
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
• Branch and Price for Chance-Constrained Bin Packing
• Binary decision diagrams for bin packing with minimum color fragmentation

Cited In (3)

• Almost optimal solutions for bin coloring problems
• Locality-preserving allocations problems and coloured bin packing
• Algorithms and Computation

Uses Software

• Gurobi
• Scikit

This page was built for publication: Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation

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