Alain Hertz

160 papers A 1B 1C 1Journal 152Unranked 5
YearRankTypeTitle / Venue / Authors
2026 — conf
A Privacy-Preserving Hypercube Framework for Interactive Recommendations.
IUI Companion
Adir Solomon, Alan J. Wecker, Noa Tuval, Alain Hertz, Tsvi Kuflik
2026 J jnl
Investigating the Relationship Between User Preferences, Previous Ratings and User Judgments Related to Serendipity.
Int. J. Hum. Comput. Interact.
Alain Hertz, Tsvi Kuflik, Noa Tuval
2025 J jnl
Addressing the cold start problem in privacy preserving content-based recommender systems using hypercube graphs.
RAIRO Oper. Res.
Noa Tuval, Alain Hertz, Tsvi Kuflik
2025 J jnl
ChemicHull: an online tool for determining extremal chemical graphs of maximum degree at most 3 for any degree-based topological indices.
CoRR
Sébastien Bonte, Gauvain Devillez, Valentin Dusollier, Alain Hertz, Hadrien Mélot, David Schindl
2025 J jnl
Complete polyhedral description of chemical graphs of maximum degree at most 3.
CoRR
Valentin Dusollier, Sébastien Bonte, Gauvain Devillez, Alain Hertz, Hadrien Mélot, David Schindl
2025 J jnl
Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices.
CoRR
Sébastien Bonte, Gauvain Devillez, Valentin Dusollier, Alain Hertz, Hadrien Mélot
2025 J jnl
Neural Logic Networks for Interpretable Classification.
CoRR
Vincent Perreault, Katsumi Inoue, Richard Labib, Alain Hertz
2024 — conf
A Roadmap for Privacy Preserving Tourist Recommendation Systems.
RecTour@RecSys
Alan J. Wecker, Noa Tuval, Alain Hertz, Mohammad Mahamid, Tsvi Kuflik
2024 J jnl
Extremal Chemical Graphs for the Arithmetic-Geometric Index.
CoRR
Alain Hertz, Sébastien Bonte, Gauvain Devillez, Valentin Dusollier, Hadrien Mélot, David Schindl
2024 J jnl
Graphs obtained by disjoint unions and joins of cliques and stable sets.
RAIRO Oper. Res.
Alain Hertz
2024 J jnl
The average size of maximal matchings in graphs.
J. Comb. Optim.
Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot
2023 A conf
A Lagrangian-based approach to learn distance metrics for clustering with minimal data transformation.
SDM
Rodrigo Randel, Daniel Aloise, Alain Hertz
2023 J jnl
A machine learning framework for neighbor generation in metaheuristic search.
Frontiers Appl. Math. Stat.
Defeng Liu, Vincent Perreault, Alain Hertz, Andrea Lodi
2023 J jnl
Addressing the cold start problem in privacy preserving content-based recommender systems using hypercube graphs.
CoRR
Noa Tuval, Alain Hertz, Tsvi Kuflik
2023 J jnl
Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph.
Discret. Appl. Math.
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez
2023 J jnl
Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph.
Graphs Comb.
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez, Pierre Hauweele
2022 J jnl
A machine learning framework for neighbor generation in metaheuristic search.
CoRR
Defeng Liu, Vincent Perreault, Alain Hertz, Andrea Lodi
2022 J jnl
The average size of maximal matchings in graphs.
CoRR
Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot
2021 J jnl
A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering.
Data Min. Knowl. Discov.
Rodrigo Randel, Daniel Aloise, Simon J. Blanchard, Alain Hertz
2021 J jnl
An exact algorithm for a class of geometric set-cover problems.
Discret. Appl. Math.
Claudio Contardo, Alain Hertz
2021 J jnl
Decycling bipartite graphs.
J. Graph Algorithms Appl.
Alain Hertz
2021 J jnl
Exploring dual information in distance metric learning for clustering.
CoRR
Rodrigo Randel, Daniel Aloise, Alain Hertz
2021 J jnl
Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph.
CoRR
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez
2021 J jnl
Resolving sets and integer programs for recommender systems.
J. Glob. Optim.
Alain Hertz, Tsvi Kuflik, Noa Tuval
2021 J jnl
Upper bounds on the average number of colors in the non-equivalent colorings of a graph.
CoRR
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez, Pierre Hauweele
2021 J jnl
Using Graph Theory to Derive Inequalities for the Bell Numbers.
CoRR
Alain Hertz, Anaelle Hertz, Hadrien Mélot
2020 J jnl
A tabu search for the design of capacitated rooted survivable planar networks.
J. Heuristics
Alain Hertz, Thomas Ridremont
2020 J jnl
An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes.
Optim. Lett.
Alain Hertz
2020 J jnl
An exact dynamic programming algorithm for the precedence-constrained class sequencing problem.
Comput. Oper. Res.
Reinhard Bürgy, Alain Hertz, Pierre Baptiste
2020 J jnl
On the edge capacitated Steiner tree problem.
Discret. Optim.
Cédric Bentz, Marie-Christine Costa, Alain Hertz
2019 J jnl
A comparison of integer programming models for the partial directed weighted improper coloring problem.
Discret. Appl. Math.
Alain Hertz, Romain Montagné, François Gagnon
2019 J jnl
Maximum eccentric connectivity index for graphs with given diameter.
Discret. Appl. Math.
Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez
2018 J jnl
A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree.
Discret. Appl. Math.
Romain Absil, Eglantine Camby, Alain Hertz, Hadrien Mélot
2018 J jnl
Dominating induced matchings in graphs containing no long claw.
J. Graph Theory
Alain Hertz, Vadim V. Lozin, Bernard Ries, Viktor Zamaraev, Dominique de Werra
2018 J jnl
Maximum Eccentric Connectivity Index for Graphs with Given Diameter.
CoRR
Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez
2018 J jnl
Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices.
CoRR
Gauvain Devillez, Alain Hertz, Hadrien Mélot, Pierre Hauweele
2018 J jnl
Online algorithms for the maximum k-colorable subgraph problem.
Comput. Oper. Res.
Alain Hertz, Romain Montagné, François Gagnon
2017 J jnl
Design of a wind farm collection network when several cable types are available.
J. Oper. Res. Soc.
Alain Hertz, Odile Marcotte, Asma Mdimagh, Michel Carreau, François Welt
2017 J jnl
Online heuristics for unloading boxes off a gravity conveyor.
Int. J. Prod. Res.
Pierre Baptiste, Reinhard Bürgy, Alain Hertz, Djamal Rebaine
2017 J jnl
Symmetry Breaking Constraints for the Minimum Deficiency Problem.
J. Graph Algorithms Appl.
Sivan Altinakar, Gilles Caporossi, Alain Hertz
2017 J jnl
Tabu Search for the RNA Partial Degradation Problem.
Int. J. Appl. Math. Comput. Sci.
Agnieszka Rybarczyk, Alain Hertz, Marta Kasprzak, Jacek Blazewicz
2016 J jnl
A comparison of integer and constraint programming models for the deficiency problem.
Comput. Oper. Res.
Sivan Altinakar, Gilles Caporossi, Alain Hertz
2016 J jnl
Constructive algorithms for the partial directed weighted improper coloring problem.
J. Graph Algorithms Appl.
Alain Hertz, Romain Montagné, François Gagnon
2016 J jnl
Counting the number of non-equivalent vertex colorings of a graph.
Discret. Appl. Math.
Alain Hertz, Hadrien Mélot
2016 J jnl
On the edge capacitated Steiner tree problem.
CoRR
Cédric Bentz, Marie-Christine Costa, Alain Hertz
2015 J jnl
Directed weighted improper coloring for cellular channel allocation.
Discret. Appl. Math.
Claudia Archetti, Nicola Bianchessi, Alain Hertz, Adrien Colombet, François Gagnon
2015 J jnl
Dominating induced matchings in graphs containing no long claw.
CoRR
Alain Hertz, Vadim V. Lozin, Bernard Ries, Victor Zamaraev, Dominique de Werra
2015 J jnl
Foreword.
Discret. Appl. Math.
Jacek Blazewicz, Alain Hertz, Christophe Picouleau, Marino Widmer
2014 J jnl
A branch-and-price algorithm for the robust graph coloring problem.
Discret. Appl. Math.
Claudia Archetti, Nicola Bianchessi, Alain Hertz
2014 J jnl
Automated generation of conjectures on forbidden subgraph characterization.
Discret. Appl. Math.
Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz
2014 J jnl
Incomplete service and split deliveries in a routing problem with profits.
Networks
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz
2014 J jnl
The split delivery capacitated team orienteering problem.
Networks
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz
2013 J jnl
A polynomial time algorithm for unloading boxes off a gravity conveyor.
Discret. Optim.
Pierre Baptiste, Alain Hertz, André Linhares, Djamal Rebaine
2012 J jnl
A Hybrid Heuristic for an Inventory Routing Problem.
INFORMS J. Comput.
Claudia Archetti, Luca Bertazzi, Alain Hertz, Maria Grazia Speranza
2012 J jnl
Integer linear programming models for a cement delivery problem.
Eur. J. Oper. Res.
Alain Hertz, Marc Uldry, Marino Widmer
2012 J jnl
Optimizing the Design of a Wind Farm Collection Network.
INFOR Inf. Syst. Oper. Res.
Alain Hertz, Odile Marcotte, Asma Mdimagh, Michel Carreau, François Welt
2012 J jnl
Total domination and the Caccetta-Häggkvist conjecture.
Discret. Optim.
Patrick St-Louis, Bernard Gendron, Alain Hertz
2011 J jnl
Improving constrained pattern mining with first-fail-based heuristics.
Data Min. Knowl. Discov.
Christian Desrosiers, Philippe Galinier, Alain Hertz, Pierre Hansen
2011 J jnl
On compact k-edge-colorings: A polynomial time reduction from linear to cyclic.
Discret. Optim.
Sivan Altinakar, Gilles Caporossi, Alain Hertz
2011 J jnl
Using local search to speed up filtering algorithms for some NP-hard constraints.
Ann. Oper. Res.
Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant
2010 J jnl
A flexible MILP model for multiple-shift workforce planning under annualized hours.
Eur. J. Oper. Res.
Alain Hertz, Nadia Lahrichi, Marino Widmer
2010 J jnl
Confection de calendriers de matchs pour le sport universitaire et collégial au Québec.
INFOR Inf. Syst. Oper. Res.
Alain Hertz, Rina Razanakoto
2010 J jnl
On a reduction of the interval coloring problem to a series of bandwidth coloring problems.
J. Sched.
Mathieu Bouchard, Mirjana Cangalovic, Alain Hertz
2010 J jnl
The undirected capacitated arc routing problem with profits.
Comput. Oper. Res.
Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza
2009 J jnl
A Magnetic Procedure for the Stability Number.
Graphs Comb.
Alain Hertz, Dominique de Werra
2009 J jnl
A comparison of five heuristics for the multiple depot vehicle scheduling problem.
J. Sched.
Ann-Sophie Pepin, Guy Desaulniers, Alain Hertz, Dennis Huisman
2009 J jnl
A patient assignment algorithm for home care services.
J. Oper. Res. Soc.
Alain Hertz, Nadia Lahrichi
2009 J jnl
A solution method for a car fleet management problem with maintenance constraints.
J. Heuristics
Alain Hertz, David Schindl, Nicolas Zufferey
2009 J jnl
About equivalent interval colorings of weighted graphs.
Discret. Appl. Math.
Mathieu Bouchard, Mirjana Cangalovic, Alain Hertz
2009 J jnl
Average distance and maximum induced forest.
J. Graph Theory
Pierre Hansen, Alain Hertz, Rim Kilani, Odile Marcotte, David Schindl
2009 J jnl
Corrigendum to "Variable space search for graph coloring" [Discrete Appl. Math. 156 (2008) 2551-2560]
Discret. Appl. Math.
Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey
2009 J jnl
Foreword.
Discret. Appl. Math.
Luca Maria Gambardella, Alain Hertz, Frédéric Maffray, Marino Widmer
2009 J jnl
Lower bounds and a tabu search algorithm for the minimum deficiency problem.
J. Comb. Optim.
Mathieu Bouchard, Alain Hertz, Guy Desaulniers
2009 — conf
Mining Graphs to Discover New Theorems in Mathematics.
MLG/SRL@ILP
Christian Desrosiers, Alain Hertz, Philippe Galinier, Pierre Hansen
2009 J jnl
The capacitated team orienteering and profitable tour problems.
J. Oper. Res. Soc.
Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza
2009 J jnl
Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems.
J. Comb. Optim.
Christian Desrosiers, Philippe Galinier, Alain Hertz, Sandrine Paroz
2008 J jnl
A sequential elimination algorithm for computing bounds on the clique number of a graph.
Discret. Optim.
Bernard Gendron, Alain Hertz, Patrick St-Louis
2008 J jnl
An adaptive memory algorithm for the k-coloring problem.
Discret. Appl. Math.
Philippe Galinier, Alain Hertz, Nicolas Zufferey
2008 J jnl
Efficient algorithms for finding critical subgraphs.
Discret. Appl. Math.
Christian Desrosiers, Philippe Galinier, Alain Hertz
2008 J jnl
Foreword.
Discret. Appl. Math.
Dominique de Werra, Endre Boros, Jacques Carlier, Alain Hertz, Marino Widmer
2008 J jnl
On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem.
Oper. Res. Lett.
Bernard Gendron, Alain Hertz, Patrick St-Louis
2008 J jnl
The Metric Cutpoint Partition Problem.
J. Classif.
Alain Hertz, Sacha Varone
2008 B conf
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints.
CPAIOR
Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant
2008 J jnl
Variable space search for graph coloring.
Discret. Appl. Math.
Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey
2007 J jnl
A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding.
Comput. Oper. Res.
Michel Gamache, Alain Hertz, Jérôme Olivier Ouellet
2007 J jnl
A note on tree realizations of matrices.
RAIRO Oper. Res.
Alain Hertz, Sacha Varone
2007 — conf
Improving Frequent Subgraph Mining in the Presence of Symmetry.
MLG
Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz
2007 J jnl
Metaheuristics for the team orienteering problem.
J. Heuristics
Claudia Archetti, Alain Hertz, Maria Grazia Speranza
2007 J jnl
On edge orienting methods for graph coloring.
J. Comb. Optim.
Bernard Gendron, Alain Hertz, Patrick St-Louis
2007 J jnl
Solution techniques for the Large Set Covering Problem.
Discret. Appl. Math.
Philippe Galinier, Alain Hertz
2007 J jnl
The Metric Bridge Partition Problem: Partitioning of a Metric Space into Two Subspaces Linked by an Edge in Any Optimal Realization.
J. Classif.
Alain Hertz, Sacha Varone
2006 J jnl
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem.
Transp. Sci.
Claudia Archetti, Maria Grazia Speranza, Alain Hertz
2006 J jnl
A survey of local search methods for graph coloring.
Comput. Oper. Res.
Philippe Galinier, Alain Hertz
2006 J jnl
Analysis of a territorial approach to the delivery of nursing home care services based on historical data.
J. Medical Syst.
Nadia Lahrichi, Sophie D. Lapierre, Alain Hertz, A. Talib, Lorraine Bouvier
2006 J jnl
Anniversary focused issue of
Comput. Oper. Res.
Alain Hertz
2006 J jnl
Augmenting chains in graphs without a skew star.
J. Comb. Theory B
Michael U. Gerber, Alain Hertz, Vadim V. Lozin
2005 J jnl
Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints.
4OR
Alain Hertz, David Schindl, Nicolas Zufferey
2004 J jnl
Preface.
Discret. Appl. Math.
Michel Gendreau, Alain Hertz, Frédéric Semet, Marino Widmer
2003 J jnl
A Lower Bound for the Job Insertion Problem.
Discret. Appl. Math.
Tamás Kis, Alain Hertz
2003 J jnl
A variable neighborhood search for graph coloring.
Eur. J. Oper. Res.
Cédric Avanthay, Alain Hertz, Nicolas Zufferey
2003 J jnl
Finding augmenting chains in extensions of claw-free graphs.
Inf. Process. Lett.
Alain Hertz, Vadim V. Lozin, David Schindl
2003 J jnl
Guidelines for the use of meta-heuristics in combinatorial optimization.
Eur. J. Oper. Res.
Alain Hertz, Marino Widmer
2003 J jnl
P
Discret. Appl. Math.
Michael U. Gerber, Alain Hertz, David Schindl
2003 J jnl
Stable sets in two subclasses of banner-free graphs.
Discret. Appl. Math.
Michael U. Gerber, Alain Hertz, Vadim V. Lozin
2002 J jnl
Bounds and Heuristics for the Shortest Capacitated Paths Problem.
J. Heuristics
Marie-Christine Costa, Alain Hertz, Michel Mittaz
2002 J jnl
Extension of Turán's Theorem to the 2-Stability Number.
Graphs Comb.
Michael U. Gerber, Pierre Hansen, Alain Hertz
2002 J jnl
Finding the Chromatic Number by Means of Critical Graphs.
ACM J. Exp. Algorithmics
Francine Herrmann, Alain Hertz
2001 J jnl
A Transformation Which Preserves the Clique Number.
J. Comb. Theory B
Michael U. Gerber, Alain Hertz
2001 J jnl
A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem.
Transp. Sci.
Alain Hertz, Michel Mittaz
2000 J jnl
A Tabu Search Heuristic for the Capacitated Arc Routing Problem.
Oper. Res.
Alain Hertz, Gilbert Laporte, Michel Mittaz
2000 J jnl
A framework for the description of evolutionary algorithms.
Eur. J. Oper. Res.
Alain Hertz, Daniel Kobler
2000 J jnl
Feasible edge colorings of trees with cardinality constraints.
Discret. Math.
Dominique de Werra, Alain Hertz, Daniel Kobler, Nadimpalli V. R. Mahadev
2000 J jnl
Finding the chromatic number by means of critical graphs.
Electron. Notes Discret. Math.
Francine Herrmann, Alain Hertz
2000 J jnl
Planification des Emplois du Temps et de la Formation au Sein d'une Grande Entreprise.
RAIRO Oper. Res.
Alain Hertz, Vincent Robert, Vincent Berthod
1999 J jnl
A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems.
Oper. Res. Lett.
Shoshana Anily, Julien Bramel, Alain Hertz
1999 J jnl
A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization.
J. Heuristics
Patrice Calégari, Giovanni Coray, Alain Hertz, Daniel Kobler, Pierre Kuonen
1999 J jnl
Improvement Procedures for the Undirected Rural Postman Problem.
INFORMS J. Comput.
Alain Hertz, Gilbert Laporte, Pierrette Nanchen Hugo
1999 J jnl
On Perfect Switching Classes.
Discret. Appl. Math.
Alain Hertz
1999 J jnl
On perfectness of sums of graphs.
Discret. Math.
Dominique de Werra, Alain Hertz
1999 J jnl
On some Properties of DNA Graphs.
Discret. Appl. Math.
Jacek Blazewicz, Alain Hertz, Daniel Kobler, Dominique de Werra
1999 J jnl
Preface.
Discret. Appl. Math.
Jacques Carlier, Alain Hertz, Frédéric Maffray, Marino Widmer
1998 J jnl
A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows.
Oper. Res.
Michel Gendreau, Alain Hertz, Gilbert Laporte, Mihnea Stan
1998 J jnl
Constructing a course schedule by solving a series of assignment type problems.
Eur. J. Oper. Res.
Alain Hertz, Vincent Robert
1998 J jnl
On Perfect Switching Classes.
Discret. Appl. Math.
Alain Hertz
1997 J jnl
An Approximation Algorithm for the Traveling Salesman Problem with Backhauls.
Oper. Res.
Michel Gendreau, Gilbert Laporte, Alain Hertz
1997 J jnl
On the Use of Boolean Methods for the Computation of the Stability Number.
Discret. Appl. Math.
Alain Hertz
1997 J jnl
Splitting trees.
Discret. Math.
Pierre Hansen, Alain Hertz, Nicolas Quinodoz
1996 J jnl
An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints.
Discret. Appl. Math.
Alain Hertz, Marino Widmer
1996 J jnl
An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques.
Oper. Res.
Jacques A. Ferland, Alain Hertz, Alain Lavoie
1996 J jnl
Preface.
Discret. Appl. Math.
Alain Hertz, Maurice Queyranne, Marino Widmer
1996 J jnl
The Traveling Salesman Problem with Backhauls.
Comput. Oper. Res.
Michel Gendreau, Alain Hertz, Gilbert Laporte
1996 J jnl
on a Scheduling Problem in a Robotized Analytical System.
Discret. Appl. Math.
Alain Hertz, Yves Mottet, Yves Rochat
1995 J jnl
Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs.
J. Heuristics
Daniel Costa, Alain Hertz, Clivier Dubuis
1995 C conf
How to Decompose Constrained Course Scheduling Problems into Easier Assignment Type Subproblems.
PATAT
Vincent Robert, Alain Hertz
1995 J jnl
Polynomially Solvable Cases for the Maximum Stable Set Problem.
Discret. Appl. Math.
Alain Hertz
1994 J jnl
A New Polynomial-Time Algorithm for the Maximum Weighted (\chi(G) - 1)-Coloring Problem in Comparability Graphs.
Math. Syst. Theory
Alain Hertz
1994 J jnl
A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing.
Discret. Appl. Math.
Alain Hertz, Brigitte Jaumard, Celso C. Ribeiro
1994 J jnl
Local Optima Topology for the
Discret. Appl. Math.
Alain Hertz, Brigitte Jaumard, Marcus Poggi de Aragão
1993 J jnl
Bounded vertex colorings of graphs.
Discret. Math.
Pierre Hansen, Alain Hertz, Julio Kuplinsky
1993 J jnl
Most unbreakable murky graphs are bull-free.
Graphs Comb.
Alain Hertz
1993 J jnl
On the stability number of AH-free graphs.
J. Graph Theory
Alain Hertz, Dominique de Werra
1992 J jnl
Finding a feasible course schedule using Tabu search.
Discret. Appl. Math.
Alain Hertz
1992 J jnl
Foreword.
Discret. Appl. Math.
Dominique de Werra, Alain Hertz
1992 J jnl
New Insertion and Postoptimization Procedures for the Traveling Salesman Problem.
Oper. Res.
Michel Gendreau, Alain Hertz, Gilbert Laporte
1991 J jnl
Cosine: A new graph coloring algorithm.
Oper. Res. Lett.
Alain Hertz
1990 J jnl
A fast algorithm for coloring Meyniel graphs.
J. Comb. Theory B
Alain Hertz
1990 J jnl
Bipolarizable graphs.
Discret. Math.
Alain Hertz
1990 — conf
Elaboration of the SEPT Expert System as the Coupling of a Simulator and a Diagnostician.
IEA/AIE (Vol. 1)
Patrick Brézillon, Dong-Yih Bau, Alain Hertz, A. P. Fauquembergue Maizener
1990 J jnl
Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph.
Comput. Oper. Res.
Charles Friden, Alain Hertz, Dominique de Werra
1990 J jnl
The Tabu Search Metaheuristic: How we used it.
Ann. Math. Artif. Intell.
Alain Hertz, Dominique de Werra
1989 J jnl
Connected sequential colorings.
Discret. Math.
Alain Hertz, Dominique de Werra
1989 J jnl
Foreword.
Discret. Math.
Alain Hertz, Dominique de Werra
1989 J jnl
STABULUS: A technique for finding stable sets in large graphs with tabu search.
Computing
Charles Friden, Alain Hertz, Dominique de Werra
1989 J jnl
Skeletal graphs - a new class of perfect graphs.
Discret. Math.
Alain Hertz
1989 J jnl
Slim graphs.
Graphs Comb.
Alain Hertz
1988 J jnl
Bipartable graphs.
J. Comb. Theory B
Alain Hertz
1988 J jnl
Consecutive colorings of graphs.
ZOR Methods Model. Oper. Res.
Dominique de Werra, Alain Hertz
1988 J jnl
Perfectly orderable graphs are quasi-parity graphs: a short proof.
Discret. Math.
Alain Hertz, Dominique de Werra
1987 J jnl
Using tabu search techniques for graph coloring.
Computing
Alain Hertz, Dominique de Werra
1986 J jnl
Quelques utilisations de la struction.
Discret. Math.
Alain Hertz