New lower bounds for bin packing problems with conflicts (Q976310): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2010.01.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049071849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional packing problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for time constrained scheduling / 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: Algorithms for the Bin Packing Problem with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: New classes of fast lower bounds for bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general framework for bounds for higher-dimensional orthogonal packing problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Dimensional Finite Bin-Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / 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: The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347319 / 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 two-dimensional cutting stock and strip packing problems using dynamic programming and column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problems with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new exact method for the two-dimensional orthogonal packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the two-dimensional strip packing problem with and without rotations / rank
 
Normal rank

Latest revision as of 21:42, 2 July 2024

scientific article
Language Label Description Also known as
English
New lower bounds for bin packing problems with conflicts
scientific article

    Statements

    New lower bounds for bin packing problems with conflicts (English)
    0 references
    0 references
    0 references
    0 references
    11 June 2010
    0 references
    bin packing with conflicts
    0 references
    Knapsack problem
    0 references
    lower bounds
    0 references
    chordal graphs
    0 references
    tree-decomposition
    0 references
    dual-feasible functions
    0 references
    0 references
    0 references

    Identifiers