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