Variable neighborhood search for the vertex separation problem

Computers and Operations Research

Volumn 39, Issue 12, 2012, Pages 3247-3255

  Duarte, Abraham ^a   Escudero, Laureano F ^a   Martí, Rafael ^b   Mladenovic, Nenad ^c   Pantrigo, Juan José ^a   Sánchez Oro, Jesús ^a  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b UNIVERSITY OF VALENCIA   (Spain)

^c Department of Mathematics   (United Kingdom)

Author keywords

Combinatorial optimization; Layout problems; Metaheuristics; Variable neigborhood search

Indexed keywords

COMPILER DESIGN; COMPUTATIONAL RESULTS; COMPUTING TIME; EXACT APPROACH; GENERAL GRAPH; GRAPH DRAWING; GRAPH PROBLEMS; HIGH-QUALITY SOLUTIONS; LAYOUT PROBLEMS; META HEURISTIC ALGORITHM; META HEURISTICS; METAHEURISTIC; NP-HARD; OPTIMAL SOLUTIONS; OPTIMIZATION MODELS; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME ALGORITHMS; SEPARATION PROBLEMS; VARIABLE NEIGBORHOOD SEARCH; VARIABLE NEIGHBORHOOD SEARCH;

COMBINATORIAL OPTIMIZATION; DRAWING (GRAPHICS); MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; SEPARATION;

GRAPH THEORY;

EID: 84862978079     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2012.04.017     Document Type: Article

References (34)

1. Bodlaender HL, Möhring RH. The pathwidth and treewidth of cographs. In: Proceedings of the second Scandinavian workshop on algorithm theory, SWAT90; 1990. p. 301-9.
2. H.L. Bodlaender, T. Kloks, and D. Kratsch Treewidth and pathwidth of permutation graphs SIAM Journal of Discrete Mathematics 8 4 1995 606 616
3. H.L. Bodlaender, J.R. Gilbert, H. Hafsteinsson, and T. Kloks Approximating treewidth, pathwidth, frontsize, and shortest elimination tree Journal of Algorithms 18 2 1995 238 255
4. Bodlaender HL, Gustedt J, Telle JA. Linear-time register allocation for a fixed number of registers. In: Proceedings of the symposium on discrete algorithms; 1998. p. 574-3.
5. B. Bollobás, and I. Leader Edge-isoperimetric inequalities in the grid Combinatorica 11 1991 299 314
6. J. Díaz, M.D. Penrose, J. Petit, and M. Serna Approximating layout problems on random geometric graphs Algorithms 39 1 2001 78 116 (Pubitemid 33666059)
7. J. Díaz, J. Petit, and M. Serna A survey of graph layout problems ACM Computing Survey 34 3 2002 313 356
8. A. Duarte, R. Martí, M.G.C. Resende, and R.M.A. Silva GRASP with path relinking heuristics for the antibandwidth problem Networks 58 3 2011 171 189
9. V. Dujmović, M.R. Fellows, M. Kitching, G. Liotta, K. Mccartin, and N. Nishimura On the parameterized complexity of layered graph drawing Algorithmica 52 2 2008 267 292
10. J.A. Ellis, I.H. Sudborough, and J.S. Turner The vertex separation and search number of a graph Information and Computation 113 1978 50 79
11. J.A. Ellis, I.H. Sudborough, and J.S. Turner The vertex separation and search number of a graph Journal of Information and Computation 113 1994 50 79
12. J.A. Ellis, and M. Markov Computing the vertex separation of unicyclic graphs Information Computing 192 2 2004 123 161
13. M.R. Fellows, and M.A. Langston On search, decision and the efficiency of polynomial-time algorithms Journal of Computing Systems Sciences 49 3 1994 769 779 (Pubitemid 124013339)
14. F.V. Fomin, and K. Hie Pathwidth of cubic graphs and exact algorithms Information Processing Letters 97 2006 191 196 (Pubitemid 43060082)
15. J. Gustedt On the pathwidth of chordal graphs Discrete Applied Mathematics 45 3 1993 233 248
16. P.W. Goldberg, M.C. Golumbic, H. Kaplan, and R. Shamir Four strikes against physical mapping of DNA Journal of Computing Biology 12 1 1995 139 152
17. P. Hansen, N. Mladenovic, and J.A. Moreno Variable neighbourhood search: methods and applications Annals of Operations Research 175 1 2010 367 407
18. IBM ILOG CPLEX, User manual; 2009.
19. N.G. Kinnersley The vertex separation number of a graph equals its path-width Information Processing Letters 42 6 1992 345 350
20. N.G. Kinnersley, and M.A. Langston Obstruction set isolation for the gate matrix layout problem Discrete Applied Mathematics 54 2-3 1994 169 213
21. M. Kirousis, and C.H. Papadimitriou Interval graphs and searching Discrete Mathematics 55 2 1985 181 184
22. M. Kirousis, and C.H. Papadimitriou Searching and pebbling Theory of Computation Sciences 47 2 1986 205 218
23. Leiserson CE. Area-efficient graph layouts (for VLSI). In: Proceedings of IEEE symposium on foundations of computer science; 1980. p. 270-1.
24. T. Lengauer Black-white pebbles and graph separation Acta Informatica 16 1981 465 475
25. J.G. Lewis The Gibbs-Poole-Stockmeyer and Gibbs-King algorithms for reordering sparse matrices ACM Transactions on Mathematical Software 8 1982 190 194
26. R.J. Lipton, and R.E. Tarjan A separator theorem for planar graphs SIAM Journal of Applied Mathematics 36 1979 177 189
27. G.A. Miller The magical number seven, plus or minus two SIAM Journal of Applied Mathematics 13 1956 81 97
28. N. Mladenović, and P. Hansen Variable neighborhood search Computers and Operations Research 24 1997 1097 1100
29. B. Monien, and I.H. Sudborough Min cut is NP-complete for edge weighted trees Theory of Computation Sciences 58 1988 209 229
30. Pantrigo JJ, Martí R, Duarte A, Pardo EG. Scatter search for the cutwidth minimization problem. Annals of Operations Research, doi:10.1007/s10479-011-0907-2.
31. Peng SL, Ho C-W, Hsu TS, Ko MT, Tang CY. A linear-time algorithm for constructing an optimal node-search strategy of a tree. In: Proceedings of the fourth annual international conference on computing and combinatorics, COCOON98; 1998. p. 279-8. (Pubitemid 128115315)
32. A. Raspaud, H. Schröder, O. Sýkora, L. Török, and I. Vrto Antibandwidth and cyclic antibandwidth of meshes and hypercubes Discrete Mathematics 309 2009 3541 3552
33. M.G.C. Resende, R. Martí, and M. Gallego Duarte a GRASP and path relinking for the max-min diversity problem Computers and Operations Research 37 2010 498 508
34. Skodinis K. Computing optimal strategies for trees in linear time. In: Proceedings of the eighth annual European symposium on algorithms; 2000. pp. 403-4.