Recent advances on two-dimensional bin packing problems (Q697576): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Shelf Algorithms for Two-Dimensional Packing Problems / 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 Algorithm for Two-Dimensional Cutting Problems / 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: Packings in two dimensions: Asymptotic average-case analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the non-oriented two-dimensional bin packing problem / 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: A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840364 / 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: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / 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: Integer linear programming models for 2-staged two-dimensional knapsack problems / 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

Latest revision as of 17:10, 4 June 2024

scientific article
Language Label Description Also known as
English
Recent advances on two-dimensional bin packing problems
scientific article

    Statements

    Recent advances on two-dimensional bin packing problems (English)
    0 references
    0 references
    0 references
    0 references
    17 September 2002
    0 references
    The paper is the survey of recent advances obtained for the two-dimensional bin packing problem with special emphasis on exact algorithms and effective heuristic and metaheuristic approaches. The authors consider only off-line heuristic algorithms, for which it is assumed that the algorithm has full knowledge of the whole input. In particular it is presented some estimations of the optimal solution value. It is given the extensive list of the literature on this theme.
    0 references
    0 references
    bin packing problems
    0 references
    algorithms
    0 references
    survey
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references