A beam search implementation for the irregular shape packing problem (Q964846): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10732-008-9095-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029050146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu thresholding implementation for the irregular stock cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete and robust no-fit polygon generation for the irregular stock cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jostling for position: local improvement for irregular cutting patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for polygon placement using a bottom-left strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast neighborhood search for two- and three-dimensional nesting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-exchange heuristic for nesting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing approach to the nesting problem in the textile manufacturing industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing closely matching upper and lower bounds on textile nesting problems / 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: TOPOS -- A new constructive algorithm for nesting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job shop scheduling with beam search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank

Latest revision as of 16:42, 2 July 2024

scientific article
Language Label Description Also known as
English
A beam search implementation for the irregular shape packing problem
scientific article

    Statements

    A beam search implementation for the irregular shape packing problem (English)
    0 references
    0 references
    0 references
    21 April 2010
    0 references
    cutting and packing
    0 references
    nesting problems
    0 references
    irregular shape
    0 references
    beam search
    0 references

    Identifiers