[PDF][PDF] A tutorial on variable neighborhood search
P Hansen, N Mladenovic - Les Cahiers du GERAD ISSN, 2003 - staff.fmi.uvt.ro
Abstract Variable Neighborhood Search (VNS) is a recent metaheuristic, or framework for
building heuristics, which exploits systematically the idea of neighborhood change, both in …
building heuristics, which exploits systematically the idea of neighborhood change, both in …
From the connectivity index to various Randić-type descriptors
Y Ma, Y Shi, I Gutman, B Furtula - MATCH Communications in …, 2018 - scidar.kg.ac.rs
The Randić index was proposed by Randić in 1975 and has been widely studied in different
areas. We briefly review the Randić index and various Randić-type descriptors from 1975 to …
areas. We briefly review the Randić index and various Randić-type descriptors from 1975 to …
[图书][B] Variable neighborhood search
Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global
optimization problems whose basic idea is a systematic change of neighborhood both within …
optimization problems whose basic idea is a systematic change of neighborhood both within …
Variable neighbourhood search: methods and applications
Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
[PDF][PDF] A survey on the Randic index
X Li, Y Shi - MATCH Commun. Math. Comput. Chem, 2008 - match.pmf.kg.ac.rs
The general Randic index Rα (G) of a (chemical) graph G, is defined as the sum of the
weights (d (u) d (v)) α of all edges uv of G, where d (u) denotes the degree of a vertex u in G …
weights (d (u) d (v)) α of all edges uv of G, where d (u) denotes the degree of a vertex u in G …
Old and new results on algebraic connectivity of graphs
NMM De Abreu - Linear algebra and its applications, 2007 - Elsevier
This paper is a survey of the second smallest eigenvalue of the Laplacian of a graph G, best-
known as the algebraic connectivity of G, denoted a (G). Emphasis is given on classifications …
known as the algebraic connectivity of G, denoted a (G). Emphasis is given on classifications …
[HTML][HTML] A survey of Nordhaus–Gaddum type relations
M Aouchiche, P Hansen - Discrete Applied Mathematics, 2013 - Elsevier
In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product
of the chromatic number of a graph and its complement, in terms of the order of the graph …
of the chromatic number of a graph and its complement, in terms of the order of the graph …
Variable neighbourhood search: methods and applications
Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
[PDF][PDF] A survey on comparing Zagreb indices
B Liu, Z You - MATCH Commun. Math. Comput. Chem, 2011 - match.pmf.kg.ac.rs
A Survey on Comparing Zagreb Indices Page 1 A Survey on Comparing Zagreb Indices
Bolian Liu ∗ and Zhifu You School of Mathematical Science, South China Normal University …
Bolian Liu ∗ and Zhifu You School of Mathematical Science, South China Normal University …
[图书][B] Variable neighborhood search for extremal graphs 14: the AutoGraphiX 2 system
M Aouchiche, JM Bonnefoy, A Fidahoussen… - 2006 - Springer
The AutoGraphiX (AGX) system for computer assisted or, for some of its functions, fully
automated graph theory was developed at GERAD, Montreal since 1997. We report here on …
automated graph theory was developed at GERAD, Montreal since 1997. We report here on …