Multiple objective programming for the quadratic assignment problem (Q3767144): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Behnam B. Malakooti / rank
Normal rank
 
Property / author
 
Property / author: Behnam B. Malakooti / rank
 
Normal rank
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.1080/00207548708919840 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972121002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper efficiency and the theory of vector maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Perturbation Scheme to Improve Hillier’s Solution to the Facilities Layout Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3716769 / rank
 
Normal rank

Latest revision as of 12:12, 18 June 2024

scientific article
Language Label Description Also known as
English
Multiple objective programming for the quadratic assignment problem
scientific article

    Statements

    Multiple objective programming for the quadratic assignment problem (English)
    0 references
    0 references
    0 references
    1987
    0 references
    quadratic assignment
    0 references
    multiple objective
    0 references
    heuristic procedure
    0 references
    pairwise exchange of subfacilities
    0 references
    efficient solution
    0 references
    paired comparison method
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references