Tabu search for the cyclic bandwidth problem
暂无分享,去创建一个
Frédéric Lardeux | Gabriel Ramírez-Torres | Eduardo Rodriguez-Tello | Hillel Romero-Monsivais | E. Rodriguez-Tello | F. Lardeux | G. Ramírez-Torres | Hillel Romero-Monsivais
[1] Jin-Kao Hao,et al. Adaptive Tabu Search for course timetabling , 2010, Eur. J. Oper. Res..
[2] Imrich Vrto,et al. Antibandwidth and cyclic antibandwidth of Hamming graphs , 2013, Discret. Appl. Math..
[3] Ondrej Sýkora,et al. The Cyclic Antibandwidth Problem , 2005, Electron. Notes Discret. Math..
[4] Fred W. Glover,et al. Neighborhood analysis: a case study on curriculum-based course timetabling , 2011, J. Heuristics.
[5] Francisco Gortázar,et al. A hybrid metaheuristic for the cyclic antibandwidth problem , 2013, Knowl. Based Syst..
[6] Fred W. Glover,et al. Reducing the bandwidth of a sparse matrix with tabu search , 2001, Eur. J. Oper. Res..
[7] Michael L. Fredman,et al. The AETG System: An Approach to Testing Based on Combinatiorial Design , 1997, IEEE Trans. Software Eng..
[8] D.M. Cohen,et al. The Combinatorial Design Approach to Automatic Test Generation , 1996, IEEE Softw..
[9] José Torres-Jiménez,et al. Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three , 2009, Artificial Evolution.
[10] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[11] Imrich Vrto,et al. Antibandwidth and Cyclic Antibandwidth of Hamming Graphs , 2009, Electron. Notes Discret. Math..
[12] Andrew Lim,et al. Particle Swarm Optimization and Hill Climbing for the bandwidth minimization problem , 2006, Applied Intelligence.
[13] Ravi Kothari,et al. Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods , 2013, Eur. J. Oper. Res..
[14] Michael Affenzeller,et al. A Comprehensive Survey on Fitness Landscape Analysis , 2012, Recent Advances in Intelligent Engineering Systems.
[15] Ceyda Oguz,et al. A tabu search algorithm for order acceptance and scheduling , 2012, Comput. Oper. Res..
[16] S Koilraj,et al. Labelings of graphs , 2008 .
[17] C. Colbourn. Combinatorial aspects of covering arrays , 2006 .
[18] A. E. Eiben,et al. Parameter calibration using meta-algorithms , 2007, 2007 IEEE Congress on Evolutionary Computation.
[19] Isaac Plana,et al. GRASP and path relinking for the matrix bandwidth minimization , 2004, Eur. J. Oper. Res..
[20] Arnold L. Rosenberg,et al. Bounds on the costs of data encodings , 2005, Mathematical systems theory.
[21] Yixun Lin. Minimum bandwidth problem for embedding graphs in cycles , 1997, Networks.
[22] L. H. Harper. Optimal Assignments of Numbers to Vertices , 1964 .
[23] Oliver Vornberger,et al. On Some Variants of the Bandwidth Minimization Problem , 1984, SIAM J. Comput..
[24] Richa Bansal,et al. A memetic algorithm for the cyclic antibandwidth maximization problem , 2011, Soft Comput..
[25] Sanming Zhou. Bounding the bandwidths for graphs , 2000, Theor. Comput. Sci..
[26] Fred W. Glover,et al. Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.
[27] Dan Pritikin,et al. On the separation number of a graph , 1989, Networks.
[28] Frank Thomson Leighton,et al. A Framework for Solving VLSI Graph Layout Problems , 1983, J. Comput. Syst. Sci..
[29] A. Azadeh,et al. A meta-heuristic framework for forecasting household electricity consumption , 2011, Appl. Soft Comput..
[30] R. K. Livesley,et al. The Analysis of Large Structural Systems , 1960, Comput. J..
[31] Lin Yixun,et al. THE CYCLIC BANDWIDTH PROBLEM , 1994 .
[32] Rafael Martí,et al. A branch and bound algorithm for the matrix bandwidth minimization , 2008, Eur. J. Oper. Res..
[33] Eduardo Rodriguez-Tello,et al. Maximum Parsimony Phylogenetic Inference Using Simulated Annealing , 2012, EVOLVE.
[34] Juraj Hromkovic,et al. On Embedding Interconnection Networks into Rings of Processors , 1992, PARLE.
[35] Annalisa Massini,et al. Antibandwidth of Complete k-Ary Trees , 2006, Electron. Notes Discret. Math..
[36] Yuan Jinjiang,et al. Optimal labelling of unit interval graphs , 1995 .
[37] Francisco Gortázar,et al. Variable neighborhood search with ejection chains for the antibandwidth problem , 2012, J. Heuristics.
[38] Lindawati,et al. Fine-Tuning Algorithm Parameters Using the Design of Experiments Approach , 2011, LION.
[39] Etienne de Klerk,et al. On semidefinite programming bounds for graph bandwidth , 2013, Optim. Methods Softw..
[40] Philippe Galinier,et al. An efficient memetic algorithm for the graph partitioning problem , 2011, Ann. Oper. Res..
[41] Jarmila Chvátalová,et al. Optimal labelling of a product of two paths , 1975, Discret. Math..
[42] André Raspaud,et al. Antibandwidth and cyclic antibandwidth of meshes and hypercubes , 2009, Discret. Math..
[43] Jin-Kao Hao,et al. Memetic search for the max-bisection problem , 2013, Comput. Oper. Res..
[44] Teodor Gabriel Crainic,et al. A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems , 2012, Eur. J. Oper. Res..
[45] P. Samui. Slope Stability Analysis Using Multivariate Adaptive Regression Spline , 2013 .
[46] Dragan Urosevic,et al. Variable neighbourhood search for bandwidth reduction , 2008, Eur. J. Oper. Res..
[47] Marcone J. F. Souza,et al. A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem , 2005, JEAL.
[48] Boris Goldengorin,et al. Handbook of combinatorial optimization , 2013 .
[49] Lawren Smithline. Bandwidth of the complete k-ary tree , 1995, Discret. Math..
[50] Peter Che Bor Lam,et al. Characterization of graphs with equal bandwidth and cyclic bandwidth , 2002, Discret. Math..
[51] Mauricio G. C. Resende,et al. GRASP with path relinking heuristics for the antibandwidth problem , 2011, Networks.
[52] El-Ghazali Talbi,et al. Metaheuristics - From Design to Implementation , 2009 .
[53] José Torres-Jiménez,et al. MiTS: A New Approach of Tabu Search for Constructing Mixed Covering Arrays , 2010, MICAI.
[54] L. Beineke,et al. Selected Topics in Graph Theory 2 , 1985 .
[55] Richa Bansal,et al. Memetic algorithm for the antibandwidth maximization problem , 2011, J. Heuristics.
[56] Yoichi Takenaka,et al. Multidisciplinary design optimization for hypersonic experimental vehicle , 2007 .
[57] Imrich Vrto,et al. Antibandwidth of Three-Dimensional Meshes , 2007, Electron. Notes Discret. Math..
[58] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[59] Jin-Kao Hao,et al. A memetic algorithm for graph coloring , 2010, Eur. J. Oper. Res..
[60] Helge Toutenburg,et al. Statistical Analysis of Designed Experiments , 2003 .
[61] José Torres-Jiménez,et al. An improved simulated annealing algorithm for bandwidth minimization , 2008, Eur. J. Oper. Res..
[62] Gabriel Ramírez-Torres,et al. A New Branch and Bound Algorithm for the Cyclic Bandwidth Problem , 2012, MICAI.
[63] Peter F. Stadler,et al. Correlation in Landscapes of Combinatorial Optimization Problems , 1992 .