Two-dimensional packing problems: a survey (Q1847188): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: DBLP publication ID (P1635): journals/eor/LodiMM02, #quickstatements; #temporary_batch_1731505720702
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A algorithm for two-dimensional packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Packings in Two Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Dimensional Finite Bin-Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved BL lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation / 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: On Packing Two-Dimensional Bins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case analysis of cutting and packing in two dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Scheduling of Tasks on Identical Parallel Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some experiments with simulated annealing techniques for packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing can be solved within 1+epsilon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation scheme for strip packing of rectangles with bounded dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem / 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: A Linear Programming Approach to the Cutting Stock Problem—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistage Cutting Stock Problems of Two and More Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms / 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: An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On genetic algorithms for the packing of polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithm for the oriented two-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the three-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and bounds for two-dimensional level packing problems / 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: The Three-Dimensional Bin Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / 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: A 2.5 times optimal algorithm for packing in two dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strip-Packing Algorithm with Absolute Performance Bound 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided local search and its application to the traveling salesman problem / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/eor/LodiMM02 / rank
 
Normal rank

Latest revision as of 15:06, 13 November 2024

scientific article
Language Label Description Also known as
English
Two-dimensional packing problems: a survey
scientific article

    Statements

    Two-dimensional packing problems: a survey (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2002
    0 references
    Two-dimensional packing
    0 references
    Bin packing problems
    0 references
    Strip packing problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers