Alain Hertz

ORCID

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 37

Top Venues

CoRR

Discret. Appl. Math.

Comput. Oper. Res.

J. Graph Algorithms Appl.

Publications

Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot
The average size of maximal matchings in graphs. J. Comb. Optim. 47 (3) (2024)
Alain Hertz
Graphs obtained by disjoint unions and joins of cliques and stable sets. RAIRO Oper. Res. 58 (3) (2024)
Alain Hertz, Sébastien Bonte, Gauvain Devillez, Valentin Dusollier, Hadrien Mélot, David Schindl
Extremal Chemical Graphs for the Arithmetic-Geometric Index. CoRR (2024)
Noa Tuval, Alain Hertz, Tsvi Kuflik
Addressing the cold start problem in privacy preserving content-based recommender systems using hypercube graphs. CoRR (2023)
Defeng Liu, Vincent Perreault, Alain Hertz, Andrea Lodi
A machine learning framework for neighbor generation in metaheuristic search. Frontiers Appl. Math. Stat. 9 (2023)
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez
Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph. Discret. Appl. Math. 335 (2023)
Rodrigo Randel, Daniel Aloise, Alain Hertz
A Lagrangian-based approach to learn distance metrics for clustering with minimal data transformation. SDM (2023)
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez, Pierre Hauweele
Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph. Graphs Comb. 39 (3) (2023)
Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot
The average size of maximal matchings in graphs. CoRR (2022)
Defeng Liu, Vincent Perreault, Alain Hertz, Andrea Lodi
A machine learning framework for neighbor generation in metaheuristic search. CoRR (2022)
Alain Hertz
Decycling bipartite graphs. J. Graph Algorithms Appl. 25 (1) (2021)
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez, Pierre Hauweele
Upper bounds on the average number of colors in the non-equivalent colorings of a graph. CoRR (2021)
Rodrigo Randel, Daniel Aloise, Alain Hertz
Exploring dual information in distance metric learning for clustering. CoRR (2021)
Alain Hertz, Anaelle Hertz, Hadrien Mélot
Using Graph Theory to Derive Inequalities for the Bell Numbers. CoRR (2021)
Alain Hertz, Tsvi Kuflik, Noa Tuval
Resolving sets and integer programs for recommender systems. J. Glob. Optim. 81 (1) (2021)
Claudio Contardo, Alain Hertz
An exact algorithm for a class of geometric set-cover problems. Discret. Appl. Math. 300 (2021)
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez
Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph. CoRR (2021)
Rodrigo Randel, Daniel Aloise, Simon J. Blanchard, Alain Hertz
A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering. Data Min. Knowl. Discov. 35 (6) (2021)
Alain Hertz, Thomas Ridremont
A tabu search for the design of capacitated rooted survivable planar networks. J. Heuristics 26 (6) (2020)
Reinhard Bürgy, Alain Hertz, Pierre Baptiste
An exact dynamic programming algorithm for the precedence-constrained class sequencing problem. Comput. Oper. Res. 124 (2020)
Alain Hertz
An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes. Optim. Lett. 14 (2) (2020)
Cédric Bentz, Marie-Christine Costa, Alain Hertz
On the edge capacitated Steiner tree problem. Discret. Optim. 38 (2020)
Alain Hertz, Romain Montagné, François Gagnon
A comparison of integer programming models for the partial directed weighted improper coloring problem. Discret. Appl. Math. 261 (2019)
Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez
Maximum eccentric connectivity index for graphs with given diameter. Discret. Appl. Math. 268 (2019)
Romain Absil, Eglantine Camby, Alain Hertz, Hadrien Mélot
A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree. Discret. Appl. Math. 234 (2018)
Gauvain Devillez, Alain Hertz, Hadrien Mélot, Pierre Hauweele
Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices. CoRR (2018)
Alain Hertz, Romain Montagné, François Gagnon
Online algorithms for the maximum k-colorable subgraph problem. Comput. Oper. Res. 91 (2018)
Alain Hertz, Vadim V. Lozin, Bernard Ries, Viktor Zamaraev, Dominique de Werra
Dominating induced matchings in graphs containing no long claw. J. Graph Theory 88 (1) (2018)
Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez
Maximum Eccentric Connectivity Index for Graphs with Given Diameter. CoRR (2018)
Sivan Altinakar, Gilles Caporossi, Alain Hertz
Symmetry Breaking Constraints for the Minimum Deficiency Problem. J. Graph Algorithms Appl. 21 (2) (2017)
Alain Hertz, Odile Marcotte, Asma Mdimagh, Michel Carreau, François Welt
Design of a wind farm collection network when several cable types are available. J. Oper. Res. Soc. 68 (1) (2017)
Agnieszka Rybarczyk, Alain Hertz, Marta Kasprzak, Jacek Blazewicz
Tabu Search for the RNA Partial Degradation Problem. Int. J. Appl. Math. Comput. Sci. 27 (2) (2017)
Pierre Baptiste, Reinhard Bürgy, Alain Hertz, Djamal Rebaine
Online heuristics for unloading boxes off a gravity conveyor. Int. J. Prod. Res. 55 (11) (2017)
Sivan Altinakar, Gilles Caporossi, Alain Hertz
A comparison of integer and constraint programming models for the deficiency problem. Comput. Oper. Res. 68 (2016)
Alain Hertz, Romain Montagné, François Gagnon
Constructive algorithms for the partial directed weighted improper coloring problem. J. Graph Algorithms Appl. 20 (2) (2016)
Cédric Bentz, Marie-Christine Costa, Alain Hertz
On the edge capacitated Steiner tree problem. CoRR (2016)
Alain Hertz, Hadrien Mélot
Counting the number of non-equivalent vertex colorings of a graph. Discret. Appl. Math. 203 (2016)
Claudia Archetti, Nicola Bianchessi, Alain Hertz, Adrien Colombet, François Gagnon
Directed weighted improper coloring for cellular channel allocation. Discret. Appl. Math. 182 (2015)
Alain Hertz, Vadim V. Lozin, Bernard Ries, Victor Zamaraev, Dominique de Werra
Dominating induced matchings in graphs containing no long claw. CoRR (2015)
Jacek Blazewicz, Alain Hertz, Christophe Picouleau, Marino Widmer
Foreword. Discret. Appl. Math. 182 (2015)
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz
The split delivery capacitated team orienteering problem. Networks 63 (1) (2014)
Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz
Automated generation of conjectures on forbidden subgraph characterization. Discret. Appl. Math. 162 (2014)
Claudia Archetti, Nicola Bianchessi, Alain Hertz
A branch-and-price algorithm for the robust graph coloring problem. Discret. Appl. Math. 165 (2014)
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz
Incomplete service and split deliveries in a routing problem with profits. Networks 63 (2) (2014)
Pierre Baptiste, Alain Hertz, André Linhares, Djamal Rebaine
A polynomial time algorithm for unloading boxes off a gravity conveyor. Discret. Optim. 10 (4) (2013)
Alain Hertz, Odile Marcotte, Asma Mdimagh, Michel Carreau, François Welt
Optimizing the Design of a Wind Farm Collection Network. INFOR Inf. Syst. Oper. Res. 50 (2) (2012)
Patrick St-Louis, Bernard Gendron, Alain Hertz
Total domination and the Caccetta-Häggkvist conjecture. Discret. Optim. 9 (4) (2012)
Alain Hertz, Marc Uldry, Marino Widmer
Integer linear programming models for a cement delivery problem. Eur. J. Oper. Res. 222 (3) (2012)
Claudia Archetti, Luca Bertazzi, Alain Hertz, Maria Grazia Speranza
A Hybrid Heuristic for an Inventory Routing Problem. INFORMS J. Comput. 24 (1) (2012)
Sivan Altinakar, Gilles Caporossi, Alain Hertz
On compact k-edge-colorings: A polynomial time reduction from linear to cyclic. Discret. Optim. 8 (3) (2011)
Christian Desrosiers, Philippe Galinier, Alain Hertz, Pierre Hansen
Improving constrained pattern mining with first-fail-based heuristics. Data Min. Knowl. Discov. 23 (1) (2011)
Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant
Using local search to speed up filtering algorithms for some NP-hard constraints. Ann. Oper. Res. 184 (1) (2011)
Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza
The undirected capacitated arc routing problem with profits. Comput. Oper. Res. 37 (11) (2010)
Mathieu Bouchard, Mirjana Cangalovic, Alain Hertz
On a reduction of the interval coloring problem to a series of bandwidth coloring problems. J. Sched. 13 (6) (2010)
Alain Hertz, Nadia Lahrichi, Marino Widmer
A flexible MILP model for multiple-shift workforce planning under annualized hours. Eur. J. Oper. Res. 200 (3) (2010)
Alain Hertz, Rina Razanakoto
Confection de calendriers de matchs pour le sport universitaire et collégial au Québec. INFOR Inf. Syst. Oper. Res. 48 (3) (2010)
Ann-Sophie Pepin, Guy Desaulniers, Alain Hertz, Dennis Huisman
A comparison of five heuristics for the multiple depot vehicle scheduling problem. J. Sched. 12 (1) (2009)
Alain Hertz, David Schindl, Nicolas Zufferey
A solution method for a car fleet management problem with maintenance constraints. J. Heuristics 15 (5) (2009)
Pierre Hansen, Alain Hertz, Rim Kilani, Odile Marcotte, David Schindl
Average distance and maximum induced forest. J. Graph Theory 60 (1) (2009)
Christian Desrosiers, Philippe Galinier, Alain Hertz, Sandrine Paroz
Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems. J. Comb. Optim. 18 (2) (2009)
Luca Maria Gambardella, Alain Hertz, Frédéric Maffray, Marino Widmer
Foreword. Discret. Appl. Math. 157 (17) (2009)
Alain Hertz, Nadia Lahrichi
A patient assignment algorithm for home care services. J. Oper. Res. Soc. 60 (4) (2009)
Mathieu Bouchard, Alain Hertz, Guy Desaulniers
Lower bounds and a tabu search algorithm for the minimum deficiency problem. J. Comb. Optim. 17 (2) (2009)
Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey
Corrigendum to "Variable space search for graph coloring" [Discrete Appl. Math. 156 (2008) 2551-2560] Discret. Appl. Math. 157 (7) (2009)
Mathieu Bouchard, Mirjana Cangalovic, Alain Hertz
About equivalent interval colorings of weighted graphs. Discret. Appl. Math. 157 (17) (2009)
Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza
The capacitated team orienteering and profitable tour problems. J. Oper. Res. Soc. 60 (6) (2009)
Alain Hertz, Dominique de Werra
A Magnetic Procedure for the Stability Number. Graphs Comb. 25 (5) (2009)
Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints. CPAIOR (2008)
Alain Hertz, Sacha Varone
The Metric Cutpoint Partition Problem. J. Classif. 25 (2) (2008)
Dominique de Werra, Endre Boros, Jacques Carlier, Alain Hertz, Marino Widmer
Foreword. Discret. Appl. Math. 156 (13) (2008)
Christian Desrosiers, Philippe Galinier, Alain Hertz
Efficient algorithms for finding critical subgraphs. Discret. Appl. Math. 156 (2) (2008)
Philippe Galinier, Alain Hertz, Nicolas Zufferey
An adaptive memory algorithm for the k-coloring problem. Discret. Appl. Math. 156 (2) (2008)
Bernard Gendron, Alain Hertz, Patrick St-Louis
On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem. Oper. Res. Lett. 36 (3) (2008)
Bernard Gendron, Alain Hertz, Patrick St-Louis
A sequential elimination algorithm for computing bounds on the clique number of a graph. Discret. Optim. 5 (3) (2008)
Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey
Variable space search for graph coloring. Discret. Appl. Math. 156 (13) (2008)
Claudia Archetti, Alain Hertz, Maria Grazia Speranza
Metaheuristics for the team orienteering problem. J. Heuristics 13 (1) (2007)
Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz
Improving Frequent Subgraph Mining in the Presence of Symmetry. MLG (2007)
Bernard Gendron, Alain Hertz, Patrick St-Louis
On edge orienting methods for graph coloring. J. Comb. Optim. 13 (2) (2007)
Alain Hertz, Sacha Varone
A note on tree realizations of matrices. RAIRO Oper. Res. 41 (4) (2007)
Philippe Galinier, Alain Hertz
Solution techniques for the Large Set Covering Problem. Discret. Appl. Math. 155 (3) (2007)
Alain Hertz, Sacha Varone
The Metric Bridge Partition Problem: Partitioning of a Metric Space into Two Subspaces Linked by an Edge in Any Optimal Realization. J. Classif. 24 (2) (2007)
Michel Gamache, Alain Hertz, Jérôme Olivier Ouellet
A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding. Comput. Oper. Res. 34 (8) (2007)
Philippe Galinier, Alain Hertz
A survey of local search methods for graph coloring. Comput. Oper. Res. 33 (2006)
Michael U. Gerber, Alain Hertz, Vadim V. Lozin
Augmenting chains in graphs without a skew star. J. Comb. Theory, Ser. B 96 (3) (2006)
Alain Hertz
on tabu search. Comput. Oper. Res. 33 (2006)
Nadia Lahrichi, Sophie D. Lapierre, Alain Hertz, A. Talib, Lorraine Bouvier
Analysis of a territorial approach to the delivery of nursing home care services based on historical data. J. Medical Syst. 30 (4) (2006)
Claudia Archetti, Maria Grazia Speranza, Alain Hertz
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Transp. Sci. 40 (1) (2006)
Alain Hertz, David Schindl, Nicolas Zufferey
Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints. 4OR 3 (2) (2005)
Michel Gendreau, Alain Hertz, Frédéric Semet, Marino Widmer
Preface. Discret. Appl. Math. 145 (1) (2004)
Cédric Avanthay, Alain Hertz, Nicolas Zufferey
A variable neighborhood search for graph coloring. Eur. J. Oper. Res. 151 (2) (2003)
Michael U. Gerber, Alain Hertz, David Schindl
-free augmenting graphs and the maximum stable set problem. Discret. Appl. Math. 132 (1-3) (2003)
Alain Hertz, Vadim V. Lozin, David Schindl
Finding augmenting chains in extensions of claw-free graphs. Inf. Process. Lett. 86 (6) (2003)
Tamás Kis, Alain Hertz
A Lower Bound for the Job Insertion Problem. Discret. Appl. Math. 128 (2-3) (2003)
Alain Hertz, Marino Widmer
Guidelines for the use of meta-heuristics in combinatorial optimization. Eur. J. Oper. Res. 151 (2) (2003)
Michael U. Gerber, Alain Hertz, Vadim V. Lozin
Stable sets in two subclasses of banner-free graphs. Discret. Appl. Math. 132 (1-3) (2003)
Francine Herrmann, Alain Hertz
Finding the Chromatic Number by Means of Critical Graphs. ACM J. Exp. Algorithmics 7 (2002)
Marie-Christine Costa, Alain Hertz, Michel Mittaz
Bounds and Heuristics for the Shortest Capacitated Paths Problem. J. Heuristics 8 (4) (2002)
Michael U. Gerber, Pierre Hansen, Alain Hertz
Extension of Turán's Theorem to the 2-Stability Number. Graphs Comb. 18 (3) (2002)
Michael U. Gerber, Alain Hertz
A Transformation Which Preserves the Clique Number. J. Comb. Theory, Ser. B 83 (2) (2001)
Alain Hertz, Michel Mittaz
A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem. Transp. Sci. 35 (4) (2001)

Alain Hertz.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Alain Hertz