Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts (Q1761944): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Two-Dimensional Finite Bin-Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical model for the container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new constraint programming approach for the orthogonal packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional packing with conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Q4247468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient tabu search approach for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation scheme for bin packing with conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for time constrained scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for bin packing problems with conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional packing problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of the Two-Dimensional Finite Bin Packing Problem / 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: Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank
 
Normal rank

Latest revision as of 21:03, 5 July 2024

scientific article
Language Label Description Also known as
English
Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
scientific article

    Statements

    Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    cutting and packing
    0 references
    bin packing with conflicts
    0 references
    tree-decomposition
    0 references
    heuristics
    0 references
    tabu search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references