Reducing the bandwidth of a sparse matrix with tabu search
Article Abstract:
A proposed method to reduce the bandwidth of a sparse matrix with tabu search is considered, and is found to outperform other algorithms with regard to solution quality.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2001
User Contributions:
Comment about this article or add new information about this topic:
GRASP and path relinking for the matrix bandwidth minimization
Article Abstract:
A greedy randomized adaptive search procedure (GRASP) is developed for the problem of reducing the bandwidth of a matrix. The problem consists of finding a permutation of the columns and rows of a given matrix.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
User Contributions:
Comment about this article or add new information about this topic:
Principles of scatter search
Article Abstract:
The principles of scatter search concepts and its application in operations management is discussed.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem. Multicommodity flow models for spanning trees with hop constraints
- Abstracts: South Korea fines conglomerates for unfair business transactions
- Abstracts: Upper bounds and algorithms for the maximum cardinality bin packing problem. On generalized minimum spanning trees
- Abstracts: The build-high brigade is set for a drubbing in the City of London. Why the merits of the Heron Tower are so blindlingly obvious
- Abstracts: Single item lot-sizing problems with backlogging on a single machine at a finite production rate. Rotation cycle schedulings for multi-item production systems