Variable neighborhood search for the Vertex Separation Problem
- 1 December 2012
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 39 (12), 3247-3255
- https://doi.org/10.1016/j.cor.2012.04.017
Abstract
No abstract availableKeywords
Funding Information
- the Spanish Ministry of Science and Innovation (TIN2009-07516 and TIN2011-28151)
- the Government of the Community of Madrid (S2009/TIC-1542)
This publication has 30 references indexed in Scilit:
- Scatter search for the cutwidth minimization problemAnnals of Operations Research, 2011
- Variable neighbourhood search: methods and applicationsAnnals of Operations Research, 2009
- Pathwidth of cubic graphs and exact algorithmsInformation Processing Letters, 2006
- A survey of graph layout problemsACM Computing Surveys, 2002
- Approximating Layout Problems on Random Geometric GraphsJournal of Algorithms, 2001
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination TreeJournal of Algorithms, 1995
- Four Strikes Against Physical Mapping of DNAJournal of Computational Biology, 1995
- On search, decision, and the efficiency of polynomial-time algorithmsJournal of Computer and System Sciences, 1994
- Edge-isoperimetric inequalities in the gridCombinatorica, 1991
- Algorithm 582: The Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms for Reordering Sparse MatricesACM Transactions on Mathematical Software, 1982