A new constraint programming approach for the orthogonal packing problem (Q2456654): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.cor.2006.05.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2136790460 / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the two-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new exact method for the two-dimensional bin-packing problem with fixed orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for general, orthogonal, two-dimensional knapsack problems / 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: Q4475645 / 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: An Exact Algorithm for Higher-Dimensional Orthogonal Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing / 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: 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: An Algorithm for Two-Dimensional Cutting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sweep synchronization as a global propagation mechanism / 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 data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensional Packing by Bilinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5289267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability tests and time-bound adjustments for cumulative scheduling problems / 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

Latest revision as of 10:21, 27 June 2024

scientific article
Language Label Description Also known as
English
A new constraint programming approach for the orthogonal packing problem
scientific article

    Statements

    A new constraint programming approach for the orthogonal packing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 October 2007
    0 references
    two-dimensional orthogonal packing problem
    0 references
    constraint programming
    0 references
    scheduling
    0 references
    energetic reasoning
    0 references
    0 references
    0 references
    0 references

    Identifiers