9 citations · 11 across the 7 of their papers we have counts for
10 papers
A machine learning framework for neighbor generation in metaheuristic search
Defeng Liu, Vincent Perreault, Alain Hertz +1
This paper presents a methodology for integrating machine learning techniques into metaheuristics for solving combinatorial optimization problems. Namely, we propose a general mach…
The average size of maximal matchings in graphs
Alain Hertz, Sébastien Bonte, Gauvain Devillez +1
We investigate the ratio $\avM(G)$ of the average size of a maximal matching to the size of a maximum matching in a graph . If many maximal matchings have a size close to $\maxM…
Exploring dual information in distance metric learning for clustering
Rodrigo Randel, Daniel Aloise, Alain Hertz
Distance metric learning algorithms aim to appropriately measure similarities and distances between data points. In the context of clustering, metric learning is typically applied…
Upper bounds on the average number of colors in the non-equivalent colorings of a graph
Alain Hertz, Hadrien Mélot, Sébastien Bonte +2
A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition o…
Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
Alain Hertz, Hadrien Mélot, Sébastien Bonte +1
We study the average number of colors in the non-equivalent colorings of a graph . We show some general properties of this graph invariant and determine its val…
On graceful difference labelings of disjoint unions of circuits
Alain Hertz, Christophe Picouleau
A graceful difference labeling (gdl for short) of a directed graph G with vertex set V is a bijection f between V and {1,...,|V|} such that, when each arc uv is assigned the differ…