Quadratic assignment problems on series-parallel digraphs

DOI10.1007/BF01919179zbMath0596.90063OpenAlexW2048956630MaRDI QIDQ3730344

No author found.

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

quadratic assignmentNP-hardnessminimal 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)

Related Items (4)

Efficiently solvable special cases of hard combinatorial optimization problems ⋮ Solutions for subset sum problems with special digraph constraints ⋮ Room allocation: a polynomial subcase of the quadratic assignment problem ⋮ Miscellaneous Digraph Classes

Cites Work

• Unnamed Item
• Quadratic assignment problems
• A Cutting Plane Algorithm for the Linear Ordering Problem
• The Recognition of Series Parallel Digraphs
• A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem
• An Exact Algorithm for the Quadratic Assignment Problem on a Tree

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