An improved simulated annealing algorithm for bandwidth minimization
- 1 March 2008
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 185 (3) , 1319-1335
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Finding Exact Solutions to the Bandwidth Minimization ProblemComputing, 1999
- Subgraph ejection chains and tabu search for the crew scheduling problemJournal of the Operational Research Society, 1999
- A new matrix bandwidth reduction algorithmOperations Research Letters, 1998
- Ejection chains, reference structures and alternating path methods for traveling salesman problemsDiscrete Applied Mathematics, 1996
- Cooling Schedules for Optimal AnnealingMathematics of Operations Research, 1988
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problemJournal of Algorithms, 1984
- The bandwidth problem for graphs and matrices—a surveyJournal of Graph Theory, 1982
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse MatrixSIAM Journal on Numerical Analysis, 1976
- Reducing the bandwidth of sparse symmetric matrices1969