Finding linear and circular sequences of minimal and maximal total adjacency (Q1137873): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4174693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Review of the Placement and Quadratic Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-search algorithms for quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4188776 / rank
 
Normal rank

Latest revision as of 03:36, 13 June 2024

scientific article
Language Label Description Also known as
English
Finding linear and circular sequences of minimal and maximal total adjacency
scientific article

    Statements

    Finding linear and circular sequences of minimal and maximal total adjacency (English)
    0 references
    0 references
    0 references
    1980
    0 references
    computer aided geometric design
    0 references
    quadratic assignment problem
    0 references
    total adjacency
    0 references
    linear sequences
    0 references
    circular sequences
    0 references

    Identifiers