Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2013.11.008
@@ Property / DOI: 10.1016/j.cor.2013.11.008 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2013.11.008
+Normal rank
@@ Property / OpenAlex ID @@
+W1997205866
@@ Property / OpenAlex ID: W1997205866 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57856018
@@ Property / Wikidata QID: Q57856018 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth and Pathwidth of Permutation Graphs
@@ Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
+Normal rank
@@ Property / cites work @@
+Q4250226
@@ Property / cites work: Q4250226 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-isoperimetric inequalities in the grid
@@ Property / cites work: Edge-isoperimetric inequalities in the grid / rank @@
+Normal rank
@@ Property / cites work @@
+GRASP with path relinking heuristics for the antibandwidth problem
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for the vertex separation problem
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of layered graph drawing
+Normal rank
@@ Property / cites work @@
+The vertex separation and search number of a graph
+Normal rank
@@ Property / cites work @@
+Computing the vertex separation of unicyclic graphs
+Normal rank
@@ Property / cites work @@
+On search, decision, and the efficiency of polynomial-time algorithms
+Normal rank
@@ Property / cites work @@
+Variable neighbourhood search: methods and applications
+Normal rank
@@ Property / cites work @@
+A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
+Normal rank
@@ Property / cites work @@
+The vertex separation number of a graph equals its path-width
+Normal rank
@@ Property / cites work @@
+Interval graphs and searching
@@ Property / cites work: Interval graphs and searching / rank @@
+Normal rank
@@ Property / cites work @@
+Searching and pebbling
@@ Property / cites work: Searching and pebbling / rank @@
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search
@@ Property / cites work: Variable neighborhood search / rank @@
+Normal rank
@@ Property / cites work @@
+Scatter search for the cutwidth minimization problem
+Normal rank
@@ Property / cites work @@
+GRASP and path relinking for the matrix bandwidth minimization.
+Normal rank
@@ Property / cites work @@
+Antibandwidth and cyclic antibandwidth of meshes and hypercubes
+Normal rank
@@ Property / cites work @@
+An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
+Normal rank
@@ Property / cites work @@
+Q2753956
@@ Property / cites work: Q2753956 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/cor/Sanchez-OroPD14
@@ Property / DBLP publication ID: journals/cor/Sanchez-OroPD14 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2013.11.008
@@ Property / DOI: 10.1016/J.COR.2013.11.008 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:337212