GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID (Q3114612): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Packing different-sized circles into a rectangular container / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of metaheuristics / 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: 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: Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of unequal spheres and automated radiosurgical treatment planning / rank
 
Normal rank

Revision as of 22:58, 4 July 2024

scientific article
Language Label Description Also known as
English
GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID
scientific article

    Statements