LP bounds in various constraint programming approaches for orthogonal packing (Q1761178): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Principles of Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the strip packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New filtering for the cumulative constraint in the context of non-overlapping rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Two-Dimensional Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional relaxations and LP bounds for orthogonal packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conservative scales in packing 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
Property / cites work
 
Property / cites work: One-dimensional heuristics adapted for two-dimensional rectangular strip packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of dual-feasible and superadditive functions / 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: A new constraint programming approach for the orthogonal packing problem / 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 Combinatorial Characterization of Higher-Dimensional Orthogonal Packing / 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: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the guillotine strip cutting/packing problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D 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
Property / cites work
 
Property / cites work: Optimal rectangle packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-flow model for the two-dimensional guillotine cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Approach to the Strip-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP bounds in various constraint programming approaches for orthogonal packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing small boxes into a big box. / 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: Cutting and packing optimization. Problems modeling and solution methods. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank

Latest revision as of 21:46, 5 July 2024

scientific article
Language Label Description Also known as
English
LP bounds in various constraint programming approaches for orthogonal packing
scientific article

    Statements

    LP bounds in various constraint programming approaches for orthogonal packing (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    constraint programming
    0 references
    linear programming
    0 references
    column generation
    0 references
    0 references