Quadratic assignment problems on series-parallel digraphs

DOI10.1007/BF01919179MaRDI QIDQ3730344zbMATH OpenOpenAlexFDO

Authors

Publication date 1986

Published in Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01919179

zbMATH Keywords

NP-hardnessquadratic assignmentminimal vertex series-parallel digraphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• scientific article; zbMATH DE number 591196
• The quadratic assignment problem. Theory and algorithms
• Approximating the minimum quadratic assignment problems
• Two classes of quadratic assignment problems that are solvable as linear assignment problems
• A contribution to quadratic assignment problems

Cites work

• scientific article; zbMATH DE number 3982880 (Why is no real title available?)
• A Cutting Plane Algorithm for the Linear Ordering Problem
• A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem
• An Exact Algorithm for the Quadratic Assignment Problem on a Tree
• Quadratic assignment problems
• The Recognition of Series Parallel Digraphs

Cited in

(5)

• scientific article; zbMATH DE number 591196 (Why is no real title available?)
• Solutions for subset sum problems with special digraph constraints
• Room allocation: a polynomial subcase of the quadratic assignment problem
• Efficiently solvable special cases of hard combinatorial optimization problems
• Miscellaneous digraph classes

This page was built for publication: Quadratic assignment problems on series-parallel digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3730344)