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 …

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …

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 …

Over the last 15 years, hundreds of papers presenting applications of tabu search, a
heuristic method originally proposed by (1986), to various combinatorial problems have …

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …

Proposed just a few years ago, Variable Neighborhood Search (VNS) is a new metaheuristic
for combinatorial and global optimization, based upon systematic change of neighborhood …

The AutoGraphiX system determines classes of extremal or near-extremal graphs with a
variable neighborhood search heuristic. From these, conjectures may be deduced …

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 …

Chemical graphs, as other ones, are regular if all their vertices have the same degree.
Otherwise, they are irregular, and it is of interest to measure their irregularity both for …

Albertson [1] defines the imbalance of an edge (i, j)∈ E of a graph G=(V, E) as| di− dj| where
dj is the degree of a vertex j∈ V, and the irregularity irr (G) of G as the sum of imbalances of …