Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (Q5086008): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Scikit / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gurobi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/ijoc.2021.1120 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4200072569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certificates of primal or dual infeasibility in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Based on Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Diagram Decomposition for Quadratically Constrained Binary Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary decision diagrams for bin packing with minimum color fragmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4597712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and related problems: general arc-flow formulation with graph compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for the knapsack problem with setup / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders' Cuts for the Strip Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of bin-packing problems using column generation and branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bin Packing Problem with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact approaches for the knapsack problem with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics and lower bounds for the bin packing problem with conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An MDD Approach to Multidimensional Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and reduction procedures for the bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Set-Covering-Based Heuristic Approach for Bin-Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Bin Packing Problem with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(O(n\log ^2 n)\) checker and \(O(n^2\log n)\) filtering algorithm for the energetic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Co-Printing Problem: A Packing Problem with a Color Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved dynamic programming and approximation results for the knapsack problem with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of a column generation algorithm for bin packing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Price for Chance-Constrained Bin Packing / rank
 
Normal rank

Latest revision as of 12:05, 29 July 2024

scientific article; zbMATH DE number 7551226
Language Label Description Also known as
English
Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation
scientific article; zbMATH DE number 7551226

    Statements

    Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (English)
    0 references
    30 June 2022
    0 references
    bin packing
    0 references
    integer programming
    0 references
    branch-and-price
    0 references
    decision diagrams
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers