Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy
RAIRO-Oper. Res., 55 4 (2021) 2247-2264
Published online: 2021-07-29
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
1 (2025)
https://doi.org/10.1007/978-3-319-07153-4_45-2
1321 (2025)
https://doi.org/10.1007/978-3-032-00385-0_45
MATRIX BANDWIDTH REDUCTION FOR INTERPOLATION WITH SPLINES IN TENSION
Y. NazarenkoKIBERNETYKA TA SYSTEMNYI ANALIZ 99 (2025)
https://doi.org/10.34229/KCA2522-9664.25.2.9
Matrix Bandwidth Reduction for Interpolation by Splines in Tension
Y. NazarenkoCybernetics and Systems Analysis 61 (2) 250 (2025)
https://doi.org/10.1007/s10559-025-00764-0
An OpenMP‐based breadth‐first search implementation using the bag data structure
S. L. Gonzaga de Oliveira, M. I. Santana, D. N. Brandão and C. OsthoffConcurrency and Computation: Practice and Experience 36 (16) (2024)
https://doi.org/10.1002/cpe.8119
1727 (2024)
https://doi.org/10.1109/ACPEE60788.2024.10532709
14813 3 (2024)
https://doi.org/10.1007/978-3-031-64605-8_1
14813 125 (2024)
https://doi.org/10.1007/978-3-031-64605-8_9
1887 66 (2024)
https://doi.org/10.1007/978-3-031-52186-7_5
AN EVALUATION OF HEURISTIC METHODS FOR THE BANDWIDTH REDUCTION OF LARGE-SCALE GRAPHS
S. L. Gonzaga de OliveiraPesquisa Operacional 43 (2023)
https://doi.org/10.1590/0101-7438.2023.043.00268255
On the solution of the graph bandwidth problem by means of search methods
Behrooz KoohestaniApplied Intelligence 53 (7) 7988 (2023)
https://doi.org/10.1007/s10489-022-03802-y