The quadratic assignment problem in the context of the printed circuit board assembly process (Q850316): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimization of the movements of a component placement machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal bin location and sequencing in printed circuit board assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precedence constrained TSP arising in printed circuit board assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear assignment problems. Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved annealing scheme for the QAP / rank
 
Normal rank

Latest revision as of 21:56, 24 June 2024

scientific article
Language Label Description Also known as
English
The quadratic assignment problem in the context of the printed circuit board assembly process
scientific article

    Statements

    The quadratic assignment problem in the context of the printed circuit board assembly process (English)
    0 references
    0 references
    0 references
    15 November 2006
    0 references
    metaheuristics
    0 references
    combinatorial optimization
    0 references
    quadratic assignment problem
    0 references
    printed circuit board assembly
    0 references

    Identifiers