QAPS Arising as Optimization Problems in Graphs

  • Eranda Çela
Part of the Combinatorial Optimization book series (COOP, volume 1)


Many optimization problems in graphs can be formulated as QAPs with a special structure. Most of these optimization problems in graphs are NP-hard. However a number of polynomially solvable special cases have been identified for them. We believe that the general knowledge and understanding of the QAP can benefit from a closer look at these problems and the corresponding formulations as QAPs. This is the motivation for writing this chapter.


Arrangement Problem Solvable Case Weighted Adjacency Matrix Acyclic Digraph Linear Assignment Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • Eranda Çela
    • 1
  1. 1.Institute of MathematicsTechnical University GrazGrazAustria

Personalised recommendations