Let \(A = (a_{ij})\) be an \(n \times n\) matrix with entries from \(\Re \cup \{\ -\infty\ \}\\) and \(k \in \{\ 1, \ldots ,n \}\ \). The best principal submatrix problem (BPSM) is: Given matrix \(A\) and constant \(k\), find the biggest assignment problem value from all \(k \times k\) principal submatrices of \(A\). This is equivalent to finding the (\(n-k\))'th coefficient of the max-algebraic characteristic polynomial of \(A\). It has been shown that any coefficient can be found in polynomial time if it belongs to an essential term. One application of BPSM is the job rotation problem: Given workers performing a total of \(n\) jobs, where \(a_{ij}\) is the benefit of the worker currently performing job \(i\) to instead perform job \(j\), find the maximum total benefit of rotating any \(k\) jobs round. In general, no polynomial time algorithm is known for solving BPSM (or the other two equivalent problems). BPSM and related problems will be investigated. Existing and new results will be discussed for solving special cases of BPSM in polynomial time, such as when \(A\) is a generalised permutation matrix.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:489572 |
| Date | January 2007 |
| Creators | Lewis, Seth Charles |
| Publisher | University of Birmingham |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | http://etheses.bham.ac.uk//id/eprint/26/ |
Page generated in 0.0015 seconds