QAPS Arising as Optimization Problems in Graphs
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.
KeywordsArrangement Problem Solvable Case Weighted Adjacency Matrix Acyclic Digraph Linear Assignment Problem
Unable to display preview. Download preview PDF.