Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation
From MaRDI portal
Publication:5086008
DOI10.1287/ijoc.2021.1120OpenAlexW4200072569MaRDI QIDQ5086008
No author found.
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dynamic programming algorithm for the knapsack problem with setup
- Bin packing and related problems: general arc-flow formulation with graph compression
- 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
- Exact solution of bin-packing problems using column generation and branch-and-bound
- 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
- Heuristics and lower bounds for the bin packing problem with conflicts
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Binary decision diagrams for bin packing with minimum color fragmentation
- Decomposition Based on Decision Diagrams
- Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
- A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling
- A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
- Algorithms for the Bin Packing Problem with Conflicts
- A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
- Combinatorial Benders' Cuts for the Strip Packing Problem
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Branch and Price for Chance-Constrained Bin Packing
- Graph-Based Algorithms for Boolean Function Manipulation
- `` Strong NP-Completeness Results
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- Improved dynamic programming and approximation results for the knapsack problem with setups
- The Bin Packing Problem with Precedence Constraints
- An MDD Approach to Multidimensional Bin Packing
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- The Co-Printing Problem: A Packing Problem with a Color Constraint
- Certificates of primal or dual infeasibility in linear programming
This page was built for publication: Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation
