A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs-Reference-Cited by-同舟云学术

A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs

Published:2015-05 Issue: Volume:303 Page:33-49
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Torres-Jimenez Jose,Izquierdo-Marquez Idelfonso,Garcia-Robledo Alberto,Gonzalez-Gomez Aldo,Bernal Javier,Kacker Raghu N.

Funder

CONACYT

Cálculo de Covering Arrays

Fondo Mixto CONACyT y Gobierno del Estado de Tamaulipas

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference28 articles.

1. Simulated annealing;Aarts,2003

2. Sparse matrix reordering schemes for browsing hypertext;Berry;Lect. Appl. Math.,1996

3. A framework for solving {VLSI} graph layout problems;Bhatt;J. Comp. Syst. Sci.,1984

4. Adaptive memory programming for matrix bandwidth minimization;Campos;Ann. Operat. Res.,2006

5. Laying out sparse graphs with provably minimum bandwidth;Caprara;INFORMS J. Comput.,2005

Cited by 29 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A parallel variable neighborhood search for α-neighbor facility location problems;Computers & Operations Research;2024-05

2. Iterated Local Search with Tabu Search for the Bandwidth Reduction Problem in Graphs;Lecture Notes in Computer Science;2024

3. A Multi-centrality Heuristic for the Bandwidth Reduction Problem;Lecture Notes in Computer Science;2024

4. Population-based iterated greedy algorithm for the S-labeling problem;Computers & Operations Research;2023-07

5. A Reduced Variable Neighbourhood Search Algorithm for Grid Bandwidth Minimization Problem;2023 7th International Conference on Intelligent Computing and Control Systems (ICICCS);2023-05-17