Optimization of the Vertex Separation Problem with Genetic Algorithms

[1]  Horacio Hideki Yanasse,et al.  Connections between cutting-pattern sequencing, VLSI design, and flexible machines , 2002, Comput. Oper. Res..

[2]  Juan José Pantrigo,et al.  Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problem , 2014, Comput. Oper. Res..

[3]  Alexandre César Muniz de Oliveira,et al.  A constructive genetic algorithm for gate matrix layout problems , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  J. M. Valério de Carvalho,et al.  Minimization of Open Orders Using Interval Graphs , 2010 .

[5]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[6]  Zsolt Tuza,et al.  Narrowness, pathwidth, and their application in natural language processing , 1992, Discret. Appl. Math..

[7]  Juan Martín Carpio Valadez,et al.  Two New Exact Methods for the Vertex Separation Problem , 2015, Int. J. Comb. Optim. Probl. Informatics.

[8]  JOSEP DÍAZ,et al.  A survey of graph layout problems , 2002, CSUR.

[9]  Charles E. Leiserson,et al.  Area-efficient graph layouts , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[10]  Enrique Alba,et al.  Metaheuristics for the DNA Fragment Assembly Problem , 2005 .

[11]  Thomas Stützle,et al.  The linear ordering problem: Instances, search space analysis and algorithms , 2004, J. Math. Model. Algorithms.

[12]  Juan Martín Carpio Valadez,et al.  Comparative Study on Constructive Heuristics for the Vertex Separation Problem , 2015, Design of Intelligent Systems Based on Fuzzy Logic, Neural Networks and Nature-Inspired Optimization.

[13]  Mauricio G. C. Resende,et al.  GRASP with path relinking heuristics for the antibandwidth problem , 2011, Networks.

[14]  Nenad Mladenovic,et al.  Variable neighborhood search for the Vertex Separation Problem , 2012, Comput. Oper. Res..

[15]  Thomas Lengauer.  Black-white pebbles and graph separation , 2004, Acta Informatica.