The job rotation problem (JRP) is the following: Given an n × n matrix A over R ∪ {−∞} and k ≤ n, find a k × k principal submatrix of A whose optimal assignment problem value is maximum. No polynomial algorithm is known for solving this problem if k is an input variable. We analyse JRP and present polynomial solution methods for a number of special cases
We investigate a special case of the maximum quadratic assignment problem where one matrix is a prod...
This paper presents a new algorithm for the well-studied assignment problem. Our assignment algorith...
We investigate a special case of the maximum quadratic assignment problem where one matrix is a prod...
The job rotation problem (JRP) is the following: Given an n × n matrix A over R ∪ {−∞} and k ≤ n, fi...
AbstractThe job rotation problem (JRP) is the following: Given an n×n matrix A over R∪{−∞} and k≤n, ...
The job rotation problem (JRP) is the following: Given an \(n \times n\) matrix \(A\) over \(\Re \cu...
AbstractThe job rotation problem (JRP) is the following: Given an n×n matrix A over R∪{−∞} and k≤n, ...
Let \(A = (a_{ij})\) be an \(n \times n\) matrix with entries from \(\Re \cup \{\ -\infty\ \}\\) and...
Let \(A = (a_{ij})\) be an \(n \times n\) matrix with entries from \(\Re \cup \{\ -\infty\ \}\\) and...
Quadratic Assignment is a basic problem in combinatorial optimization, which generalizes several oth...
We investigate a special case of the maximum quadratic assignment problem where one matrix is a prod...
AbstractLet E=[eij] be a matrix with integral elements. We study matrices of the form X=[eeij], wher...
We investigate a special case of the maximum quadratic assignment problem where one matrix is a prod...
We investigate a special case of the maximum quadratic assignment problem where one matrix is a prod...
We investigate a special case of the maximum quadratic assignment problem where one matrix is a prod...
We investigate a special case of the maximum quadratic assignment problem where one matrix is a prod...
This paper presents a new algorithm for the well-studied assignment problem. Our assignment algorith...
We investigate a special case of the maximum quadratic assignment problem where one matrix is a prod...
The job rotation problem (JRP) is the following: Given an n × n matrix A over R ∪ {−∞} and k ≤ n, fi...
AbstractThe job rotation problem (JRP) is the following: Given an n×n matrix A over R∪{−∞} and k≤n, ...
The job rotation problem (JRP) is the following: Given an \(n \times n\) matrix \(A\) over \(\Re \cu...
AbstractThe job rotation problem (JRP) is the following: Given an n×n matrix A over R∪{−∞} and k≤n, ...
Let \(A = (a_{ij})\) be an \(n \times n\) matrix with entries from \(\Re \cup \{\ -\infty\ \}\\) and...
Let \(A = (a_{ij})\) be an \(n \times n\) matrix with entries from \(\Re \cup \{\ -\infty\ \}\\) and...
Quadratic Assignment is a basic problem in combinatorial optimization, which generalizes several oth...
We investigate a special case of the maximum quadratic assignment problem where one matrix is a prod...
AbstractLet E=[eij] be a matrix with integral elements. We study matrices of the form X=[eeij], wher...
We investigate a special case of the maximum quadratic assignment problem where one matrix is a prod...
We investigate a special case of the maximum quadratic assignment problem where one matrix is a prod...
We investigate a special case of the maximum quadratic assignment problem where one matrix is a prod...
We investigate a special case of the maximum quadratic assignment problem where one matrix is a prod...
This paper presents a new algorithm for the well-studied assignment problem. Our assignment algorith...
We investigate a special case of the maximum quadratic assignment problem where one matrix is a prod...
Add to ORKG