Quelques utilisations de la struction. - Alain Hertz (Discret. Math., 1986)

Using tabu search techniques for graph coloring. - Alain Hertz; Dominique de Werra (Computing, 1987)

Perfectly orderable graphs are quasi-parity graphs: a short proof. - Alain Hertz; Dominique de Werra (Discret. Math., 1988)

Bipartable graphs. - Alain Hertz (J. Comb. Theory B, 1988)

Consecutive colorings of graphs. - Dominique de Werra; Alain Hertz (ZOR Methods Model. Oper. Res., 1988)

STABULUS: A technique for finding stable sets in large graphs with tabu search. - Charles Friden; Alain Hertz; Dominique de Werra (Computing, 1989)

Skeletal graphs - a new class of perfect graphs. - Alain Hertz (Discret. Math., 1989)

Connected sequential colorings. - Alain Hertz; Dominique de Werra (Discret. Math., 1989)

Slim graphs. - Alain Hertz (Graphs Comb., 1989)

Elaboration of the SEPT Expert System as the Coupling of a Simulator and a Diagnostician. - Patrick Brézillon; Dong-Yih Bau; Alain Hertz; A. P. Fauquembergue Maizener (IEA/AIE (Vol. 1), 1990)

The Tabu Search Metaheuristic: How we used it. - Alain Hertz; Dominique de Werra (Ann. Math. Artif. Intell., 1990)

Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph. - Charles Friden; Alain Hertz; Dominique de Werra (Comput. Oper. Res., 1990)

Bipolarizable graphs. - Alain Hertz (Discret. Math., 1990)

A fast algorithm for coloring Meyniel graphs. - Alain Hertz (J. Comb. Theory B, 1990)

Cosine: A new graph coloring algorithm. - Alain Hertz (Oper. Res. Lett., 1991)

Finding a feasible course schedule using Tabu search. - Alain Hertz (Discret. Appl. Math., 1992)

Foreword. - Dominique de Werra; Alain Hertz (Discret. Appl. Math., 1992)

New Insertion and Postoptimization Procedures for the Traveling Salesman Problem. - Michel Gendreau; Alain Hertz; Gilbert Laporte (Oper. Res., 1992)

Bounded vertex colorings of graphs. - Pierre Hansen; Alain Hertz; Julio Kuplinsky (Discret. Math., 1993)

Most unbreakable murky graphs are bull-free. - Alain Hertz (Graphs Comb., 1993)

On the stability number of AH-free graphs. - Alain Hertz; Dominique de Werra (J. Graph Theory, 1993)

Local Optima Topology for the k-Coloring Problem. - Alain Hertz; Brigitte Jaumard; Marcus Poggi de Aragão (Discret. Appl. Math., 1994)

A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing. - Alain Hertz; Brigitte Jaumard; Celso C. Ribeiro (Discret. Appl. Math., 1994)

A New Polynomial-Time Algorithm for the Maximum Weighted ( chi(G) - 1)-Coloring Problem in Comparability Graphs. - Alain Hertz (Math. Syst. Theory, 1994)

How to Decompose Constrained Course Scheduling Problems into Easier Assignment Type Subproblems. - Vincent Robert; Alain Hertz (PATAT, 1995)

Polynomially Solvable Cases for the Maximum Stable Set Problem. - Alain Hertz (Discret. Appl. Math., 1995)

Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs. - Daniel Costa; Alain Hertz; Clivier Dubuis (J. Heuristics, 1995)

The Traveling Salesman Problem with Backhauls. - Michel Gendreau; Alain Hertz; Gilbert Laporte (Comput. Oper. Res., 1996)

on a Scheduling Problem in a Robotized Analytical System. - Alain Hertz; Yves Mottet; Yves Rochat (Discret. Appl. Math., 1996)

Preface. - Alain Hertz; Maurice Queyranne; Marino Widmer (Discret. Appl. Math., 1996)

An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints. - Alain Hertz; Marino Widmer (Discret. Appl. Math., 1996)

An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques. - Jacques A. Ferland; Alain Hertz; Alain Lavoie (Oper. Res., 1996)

On the Use of Boolean Methods for the Computation of the Stability Number. - Alain Hertz (Discret. Appl. Math., 1997)

Splitting trees. - Pierre Hansen; Alain Hertz; Nicolas Quinodoz (Discret. Math., 1997)

An Approximation Algorithm for the Traveling Salesman Problem with Backhauls. - Michel Gendreau; Gilbert Laporte; Alain Hertz (Oper. Res., 1997)

Constructing a course schedule by solving a series of assignment type problems. - Alain Hertz; Vincent Robert (Eur. J. Oper. Res., 1998)

A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows. - Michel Gendreau; Alain Hertz; Gilbert Laporte; Mihnea Stan (Oper. Res., 1998)

On some Properties of DNA Graphs. - Jacek Blazewicz; Alain Hertz; Daniel Kobler; Dominique de Werra (Discret. Appl. Math., 1999)

Preface. - Jacques Carlier; Alain Hertz; Frédéric Maffray; Marino Widmer (Discret. Appl. Math., 1999)

On Perfect Switching Classes. - Alain Hertz (Discret. Appl. Math., 1999)

On perfectness of sums of graphs. - Dominique de Werra; Alain Hertz (Discret. Math., 1999)

A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization. - Patrice Calégari; Giovanni Coray; Alain Hertz; Daniel Kobler; Pierre Kuonen (J. Heuristics, 1999)

Improvement Procedures for the Undirected Rural Postman Problem. - Alain Hertz; Gilbert Laporte; Pierrette Nanchen Hugo (INFORMS J. Comput., 1999)

A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems. - Shoshana Anily; Julien Bramel; Alain Hertz (Oper. Res. Lett., 1999)

Feasible edge colorings of trees with cardinality constraints. - Dominique de Werra; Alain Hertz; Daniel Kobler; Nadimpalli V. R. Mahadev (Discret. Math., 2000)

A framework for the description of evolutionary algorithms. - Alain Hertz; Daniel Kobler (Eur. J. Oper. Res., 2000)

A Tabu Search Heuristic for the Capacitated Arc Routing Problem. - Alain Hertz; Gilbert Laporte; Michel Mittaz (Oper. Res., 2000)

Planification des Emplois du Temps et de la Formation au Sein d'une Grande Entreprise. - Alain Hertz; Vincent Robert; Vincent Berthod (RAIRO Oper. Res., 2000)

A Transformation Which Preserves the Clique Number. - Michael U. Gerber; Alain Hertz (J. Comb. Theory B, 2001)

A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem. - Alain Hertz; Michel Mittaz (Transp. Sci., 2001)

Extension of Turán's Theorem to the 2-Stability Number. - Michael U. Gerber; Pierre Hansen; Alain Hertz (Graphs Comb., 2002)

Bounds and Heuristics for the Shortest Capacitated Paths Problem. - Marie-Christine Costa; Alain Hertz; Michel Mittaz (J. Heuristics, 2002)

Finding the Chromatic Number by Means of Critical Graphs. - Francine Herrmann; Alain Hertz (ACM J. Exp. Algorithmics, 2002)

Stable sets in two subclasses of banner-free graphs. - Michael U. Gerber; Alain Hertz; Vadim V. Lozin (Discret. Appl. Math., 2003)

P5-free augmenting graphs and the maximum stable set problem. - Michael U. Gerber; Alain Hertz; David Schindl (Discret. Appl. Math., 2003)

A Lower Bound for the Job Insertion Problem. - Tamás Kis; Alain Hertz (Discret. Appl. Math., 2003)

A variable neighborhood search for graph coloring. - Cédric Avanthay; Alain Hertz; Nicolas Zufferey (Eur. J. Oper. Res., 2003)

Guidelines for the use of meta-heuristics in combinatorial optimization. - Alain Hertz; Marino Widmer (Eur. J. Oper. Res., 2003)

Finding augmenting chains in extensions of claw-free graphs. - Alain Hertz; Vadim V. Lozin; David Schindl (Inf. Process. Lett., 2003)

Preface. - Michel Gendreau; Alain Hertz; Frédéric Semet; Marino Widmer (Discret. Appl. Math., 2004)

Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints. - Alain Hertz; David Schindl; Nicolas Zufferey (4OR, 2005)

A survey of local search methods for graph coloring. - Philippe Galinier; Alain Hertz (Comput. Oper. Res., 2006)

Anniversary focused issue of Computers & Operations Research on tabu search. - Alain Hertz (Comput. Oper. Res., 2006)

Augmenting chains in graphs without a skew star. - Michael U. Gerber; Alain Hertz; Vadim V. Lozin (J. Comb. Theory B, 2006)

Analysis of a territorial approach to the delivery of nursing home care services based on historical data. - Nadia Lahrichi; Sophie D. Lapierre; Alain Hertz; A. Talib; Lorraine Bouvier (J. Medical Syst., 2006)

A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. - Claudia Archetti; Maria Grazia Speranza; Alain Hertz (Transp. Sci., 2006)

Improving Frequent Subgraph Mining in the Presence of Symmetry. - Christian Desrosiers; Philippe Galinier; Pierre Hansen; Alain Hertz (MLG, 2007)

The Metric Bridge Partition Problem: Partitioning of a Metric Space into Two Subspaces Linked by an Edge in Any Optimal Realization. - Alain Hertz; Sacha Varone (J. Classif., 2007)

A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding. - Michel Gamache; Alain Hertz; Jérôme Olivier Ouellet (Comput. Oper. Res., 2007)

Solution techniques for the Large Set Covering Problem. - Philippe Galinier; Alain Hertz (Discret. Appl. Math., 2007)

Metaheuristics for the team orienteering problem. - Claudia Archetti; Alain Hertz; Maria Grazia Speranza (J. Heuristics, 2007)

On edge orienting methods for graph coloring. - Bernard Gendron; Alain Hertz; Patrick St-Louis (J. Comb. Optim., 2007)

A note on tree realizations of matrices. - Alain Hertz; Sacha Varone (RAIRO Oper. Res., 2007)

The Metric Cutpoint Partition Problem. - Alain Hertz; Sacha Varone (J. Classif., 2008)

Efficient algorithms for finding critical subgraphs. - Christian Desrosiers; Philippe Galinier; Alain Hertz (Discret. Appl. Math., 2008)

An adaptive memory algorithm for the k-coloring problem. - Philippe Galinier; Alain Hertz; Nicolas Zufferey (Discret. Appl. Math., 2008)

Variable space search for graph coloring. - Alain Hertz; Matthieu Plumettaz; Nicolas Zufferey (Discret. Appl. Math., 2008)

Foreword. - Dominique de Werra; Endre Boros; Jacques Carlier; Alain Hertz; Marino Widmer (Discret. Appl. Math., 2008)

A sequential elimination algorithm for computing bounds on the clique number of a graph. - Bernard Gendron; Alain Hertz; Patrick St-Louis (Discret. Optim., 2008)

On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem. - Bernard Gendron; Alain Hertz; Patrick St-Louis (Oper. Res. Lett., 2008)

Mining Graphs to Discover New Theorems in Mathematics. - Christian Desrosiers; Alain Hertz; Philippe Galinier; Pierre Hansen (MLG/SRL@ILP, 2009)

About equivalent interval colorings of weighted graphs. - Mathieu Bouchard; Mirjana Cangalovic; Alain Hertz (Discret. Appl. Math., 2009)

Foreword. - Luca Maria Gambardella; Alain Hertz; Frédéric Maffray; Marino Widmer (Discret. Appl. Math., 2009)

Corrigendum to "Variable space search for graph coloring" [Discrete Appl. Math. 156 (2008) 2551-2560] - Alain Hertz; Matthieu Plumettaz; Nicolas Zufferey (Discret. Appl. Math., 2009)

A Magnetic Procedure for the Stability Number. - Alain Hertz; Dominique de Werra (Graphs Comb., 2009)

A solution method for a car fleet management problem with maintenance constraints. - Alain Hertz; David Schindl; Nicolas Zufferey (J. Heuristics, 2009)

Lower bounds and a tabu search algorithm for the minimum deficiency problem. - Mathieu Bouchard; Alain Hertz; Guy Desaulniers (J. Comb. Optim., 2009)

Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems. - Christian Desrosiers; Philippe Galinier; Alain Hertz; Sandrine Paroz (J. Comb. Optim., 2009)

Average distance and maximum induced forest. - Pierre Hansen; Alain Hertz; Rim Kilani; Odile Marcotte; David Schindl (J. Graph Theory, 2009)

The capacitated team orienteering and profitable tour problems. - Claudia Archetti; Dominique Feillet; Alain Hertz; Maria Grazia Speranza (J. Oper. Res. Soc., 2009)

A patient assignment algorithm for home care services. - Alain Hertz; Nadia Lahrichi (J. Oper. Res. Soc., 2009)

A comparison of five heuristics for the multiple depot vehicle scheduling problem. - Ann-Sophie Pepin; Guy Desaulniers; Alain Hertz; Dennis Huisman (J. Sched., 2009)

The undirected capacitated arc routing problem with profits. - Claudia Archetti; Dominique Feillet; Alain Hertz; Maria Grazia Speranza (Comput. Oper. Res., 2010)

A flexible MILP model for multiple-shift workforce planning under annualized hours. - Alain Hertz; Nadia Lahrichi; Marino Widmer (Eur. J. Oper. Res., 2010)

Confection de calendriers de matchs pour le sport universitaire et collégial au Québec. - Alain Hertz; Rina Razanakoto (INFOR Inf. Syst. Oper. Res., 2010)

On a reduction of the interval coloring problem to a series of bandwidth coloring problems. - Mathieu Bouchard; Mirjana Cangalovic; Alain Hertz (J. Sched., 2010)

Using local search to speed up filtering algorithms for some NP-hard constraints. - Philippe Galinier; Alain Hertz; Sandrine Paroz; Gilles Pesant (Ann. Oper. Res., 2011)

Improving constrained pattern mining with first-fail-based heuristics. - Christian Desrosiers; Philippe Galinier; Alain Hertz; Pierre Hansen (Data Min. Knowl. Discov., 2011)

On compact k-edge-colorings: A polynomial time reduction from linear to cyclic. - Sivan Altinakar; Gilles Caporossi; Alain Hertz (Discret. Optim., 2011)

Total domination and the Caccetta-Häggkvist conjecture. - Patrick St-Louis; Bernard Gendron; Alain Hertz (Discret. Optim., 2012)

Integer linear programming models for a cement delivery problem. - Alain Hertz; Marc Uldry; Marino Widmer (Eur. J. Oper. Res., 2012)

Optimizing the Design of a Wind Farm Collection Network. - Alain Hertz; Odile Marcotte; Asma Mdimagh; Michel Carreau; François Welt (INFOR Inf. Syst. Oper. Res., 2012)

A Hybrid Heuristic for an Inventory Routing Problem. - Claudia Archetti; Luca Bertazzi; Alain Hertz; Maria Grazia Speranza (INFORMS J. Comput., 2012)

A polynomial time algorithm for unloading boxes off a gravity conveyor. - Pierre Baptiste; Alain Hertz; André Linhares; Djamal Rebaine (Discret. Optim., 2013)

A branch-and-price algorithm for the robust graph coloring problem. - Claudia Archetti; Nicola Bianchessi; Alain Hertz (Discret. Appl. Math., 2014)

Automated generation of conjectures on forbidden subgraph characterization. - Christian Desrosiers; Philippe Galinier; Pierre Hansen; Alain Hertz (Discret. Appl. Math., 2014)

The split delivery capacitated team orienteering problem. - Claudia Archetti; Nicola Bianchessi; Maria Grazia Speranza; Alain Hertz (Networks, 2014)

Incomplete service and split deliveries in a routing problem with profits. - Claudia Archetti; Nicola Bianchessi; Maria Grazia Speranza; Alain Hertz (Networks, 2014)

Directed weighted improper coloring for cellular channel allocation. - Claudia Archetti; Nicola Bianchessi; Alain Hertz; Adrien Colombet; François Gagnon (Discret. Appl. Math., 2015)

Foreword. - Jacek Blazewicz; Alain Hertz; Christophe Picouleau; Marino Widmer (Discret. Appl. Math., 2015)

A comparison of integer and constraint programming models for the deficiency problem. - Sivan Altinakar; Gilles Caporossi; Alain Hertz (Comput. Oper. Res., 2016)

Counting the number of non-equivalent vertex colorings of a graph. - Alain Hertz; Hadrien Mélot (Discret. Appl. Math., 2016)

Constructive algorithms for the partial directed weighted improper coloring problem. - Alain Hertz; Romain Montagné; François Gagnon (J. Graph Algorithms Appl., 2016)

Tabu Search for the RNA Partial Degradation Problem. - Agnieszka Rybarczyk; Alain Hertz; Marta Kasprzak; Jacek Blazewicz (Int. J. Appl. Math. Comput. Sci., 2017)

Online heuristics for unloading boxes off a gravity conveyor. - Pierre Baptiste; Reinhard Bürgy; Alain Hertz; Djamal Rebaine (Int. J. Prod. Res., 2017)

Symmetry Breaking Constraints for the Minimum Deficiency Problem. - Sivan Altinakar; Gilles Caporossi; Alain Hertz (J. Graph Algorithms Appl., 2017)

Design of a wind farm collection network when several cable types are available. - Alain Hertz; Odile Marcotte; Asma Mdimagh; Michel Carreau; François Welt (J. Oper. Res. Soc., 2017)

Online algorithms for the maximum k-colorable subgraph problem. - Alain Hertz; Romain Montagné; François Gagnon (Comput. Oper. Res., 2018)

Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices. - Gauvain Devillez; Alain Hertz; Hadrien Mélot; Pierre Hauweele (CoRR, 2018)

A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree. - Romain Absil; Eglantine Camby; Alain Hertz; Hadrien Mélot (Discret. Appl. Math., 2018)

Dominating induced matchings in graphs containing no long claw. - Alain Hertz; Vadim V. Lozin; Bernard Ries; Viktor Zamaraev; Dominique de Werra (J. Graph Theory, 2018)

Maximum eccentric connectivity index for graphs with given diameter. - Pierre Hauweele; Alain Hertz; Hadrien Mélot; Bernard Ries; Gauvain Devillez (Discret. Appl. Math., 2019)

A comparison of integer programming models for the partial directed weighted improper coloring problem. - Alain Hertz; Romain Montagné; François Gagnon (Discret. Appl. Math., 2019)

An exact dynamic programming algorithm for the precedence-constrained class sequencing problem. - Reinhard Bürgy; Alain Hertz; Pierre Baptiste (Comput. Oper. Res., 2020)

On the edge capacitated Steiner tree problem. - Cédric Bentz; Marie-Christine Costa; Alain Hertz (Discret. Optim., 2020)

A tabu search for the design of capacitated rooted survivable planar networks. - Alain Hertz; Thomas Ridremont (J. Heuristics, 2020)

An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes. - Alain Hertz (Optim. Lett., 2020)

Using Graph Theory to Derive Inequalities for the Bell Numbers. - Alain Hertz; Anaelle Hertz; Hadrien Mélot (CoRR, 2021)

Exploring dual information in distance metric learning for clustering. - Rodrigo Randel; Daniel Aloise; Alain Hertz (CoRR, 2021)

An exact algorithm for a class of geometric set-cover problems. - Claudio Contardo; Alain Hertz (Discret. Appl. Math., 2021)

A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering. - Rodrigo Randel; Daniel Aloise; Simon J. Blanchard; Alain Hertz (Data Min. Knowl. Discov., 2021)

Decycling bipartite graphs. - Alain Hertz (J. Graph Algorithms Appl., 2021)

Resolving sets and integer programs for recommender systems. - Alain Hertz; Tsvi Kuflik; Noa Tuval (J. Glob. Optim., 2021)

A Lagrangian-based approach to learn distance metrics for clustering with minimal data transformation. - Rodrigo Randel; Daniel Aloise; Alain Hertz (SDM, 2023)

Addressing the cold start problem in privacy preserving content-based recommender systems using hypercube graphs. - Noa Tuval; Alain Hertz; Tsvi Kuflik (CoRR, 2023)

A machine learning framework for neighbor generation in metaheuristic search. - Defeng Liu; Vincent Perreault; Alain Hertz; Andrea Lodi 001 (Frontiers Appl. Math. Stat., 2023)

Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph. - Alain Hertz; Hadrien Mélot; Sébastien Bonte; Gauvain Devillez; Pierre Hauweele (Graphs Comb., 2023)

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; Gauvain Devillez (Discret. Appl. Math., 2023)

A Roadmap for Privacy Preserving Tourist Recommendation Systems. - Alan J. Wecker; Noa Tuval; Alain Hertz; Mohammad Mahamid; Tsvi Kuflik (RecTour@RecSys, 2024)

Extremal Chemical Graphs for the Arithmetic-Geometric Index. - Alain Hertz; Sébastien Bonte; Gauvain Devillez; Valentin Dusollier; Hadrien Mélot; David Schindl (CoRR, 2024)

Graphs obtained by disjoint unions and joins of cliques and stable sets. - Alain Hertz (RAIRO Oper. Res., 2024)

The average size of maximal matchings in graphs. - Alain Hertz; Sébastien Bonte; Gauvain Devillez; Hadrien Mélot (J. Comb. Optim., 2024)

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices. - Sébastien Bonte; Gauvain Devillez; Valentin Dusollier; Alain Hertz; Hadrien Mélot (CoRR, 2025)

Complete polyhedral description of chemical graphs of maximum degree at most 3. - Valentin Dusollier; Sébastien Bonte; Gauvain Devillez; Alain Hertz; Hadrien Mélot; David Schindl (CoRR, 2025)

Neural Logic Networks for Interpretable Classification. - Vincent Perreault; Katsumi Inoue; Richard Labib; Alain Hertz (CoRR, 2025)