Parallel greedy algorithms for packing unequal circles into a strip or a rectangle (Q623818): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
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.1007/s10100-009-0103-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996188181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving circle packing problems by global optimization: numerical results and industrial applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Strategies for Meta-Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimising the palletisation of cylinders in cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated container loading software for pulp and paper industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing different-sized circles into a rectangular container / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory and Practice of Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate algorithms for constrained circular cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing approach for the circular cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithms for packing unequal circles into a rectangular container / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical model and a solution method for the problem of placing various-sized circles into a strip / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of various radii solid spheres into a parallelepiped. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5824053 / rank
 
Normal rank

Latest revision as of 18:24, 3 July 2024

scientific article
Language Label Description Also known as
English
Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
scientific article

    Statements

    Parallel greedy algorithms for packing unequal circles into a strip or a rectangle (English)
    0 references
    0 references
    0 references
    0 references
    8 February 2011
    0 references
    0 references
    packing
    0 references
    circles
    0 references
    strip packing problem
    0 references
    Knapsack problem
    0 references
    greedy method
    0 references
    parallelization
    0 references
    0 references