Quadratic assignment problems on series-parallel digraphs (Q3730344): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Quadratic Assignment Problem on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3747197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Plane Algorithm for the Linear Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01919179 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048956630 / rank
 
Normal rank

Latest revision as of 10:31, 30 July 2024

scientific article
Language Label Description Also known as
English
Quadratic assignment problems on series-parallel digraphs
scientific article

    Statements

    Quadratic assignment problems on series-parallel digraphs (English)
    0 references
    1986
    0 references
    NP-hardness
    0 references
    quadratic assignment
    0 references
    minimal vertex series-parallel digraphs
    0 references

    Identifiers