| 2009 |
|---|
| 61 | EE | Mathieu Bouchard,
Alain Hertz,
Guy Desaulniers:
Lower bounds and a tabu search algorithm for the minimum deficiency problem.
J. Comb. Optim. 17(2): 168-191 (2009) |
| 60 | EE | Pierre Hansen,
Alain Hertz,
Rim Kilani,
Odile Marcotte,
David Schindl:
Average distance and maximum induced forest.
Journal of Graph Theory 60(1): 31-54 (2009) |
| 2008 |
|---|
| 59 | EE | Philippe Galinier,
Alain Hertz,
Sandrine Paroz,
Gilles Pesant:
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints.
CPAIOR 2008: 298-302 |
| 58 | EE | Dominique de Werra,
Endre Boros,
Jacques Carlier,
Alain Hertz,
Marino Widmer:
Foreword.
Discrete Applied Mathematics 156(13): 2437-2438 (2008) |
| 57 | EE | Alain Hertz,
Matthieu Plumettaz,
Nicolas Zufferey:
Variable space search for graph coloring.
Discrete Applied Mathematics 156(13): 2551-2560 (2008) |
| 56 | EE | Christian Desrosiers,
Philippe Galinier,
Alain Hertz:
Efficient algorithms for finding critical subgraphs.
Discrete Applied Mathematics 156(2): 244-266 (2008) |
| 55 | EE | Philippe Galinier,
Alain Hertz,
Nicolas Zufferey:
An adaptive memory algorithm for the k-coloring problem.
Discrete Applied Mathematics 156(2): 267-279 (2008) |
| 54 | EE | Bernard Gendron,
Alain Hertz,
Patrick St-Louis:
A sequential elimination algorithm for computing bounds on the clique number of a graph.
Discrete Optimization 5(3): 615-628 (2008) |
| 53 | EE | 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): 345-350 (2008) |
| 2007 |
|---|
| 52 | EE | Christian Desrosiers,
Philippe Galinier,
Pierre Hansen,
Alain Hertz:
Improving Frequent Subgraph Mining in the Presence of Symmetry.
MLG 2007 |
| 51 | EE | Michel Gamache,
Alain Hertz,
Jérôme Olivier Ouellet:
A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding.
Computers & OR 34(8): 2384-2395 (2007) |
| 50 | EE | Philippe Galinier,
Alain Hertz:
Solution techniques for the Large Set Covering Problem.
Discrete Applied Mathematics 155(3): 312-326 (2007) |
| 49 | EE | Bernard Gendron,
Alain Hertz,
Patrick St-Louis:
On edge orienting methods for graph coloring.
J. Comb. Optim. 13(2): 163-178 (2007) |
| 48 | EE | Claudia Archetti,
Alain Hertz,
Maria Grazia Speranza:
Metaheuristics for the team orienteering problem.
J. Heuristics 13(1): 49-76 (2007) |
| 2006 |
|---|
| 47 | EE | Alain Hertz:
Anniversary focused issue of Computers & Operations Research on tabu search.
Computers & OR 33: 2447-2448 (2006) |
| 46 | EE | Philippe Galinier,
Alain Hertz:
A survey of local search methods for graph coloring.
Computers & OR 33: 2547-2562 (2006) |
| 45 | EE | Michael U. Gerber,
Alain Hertz,
Vadim V. Lozin:
Augmenting chains in graphs without a skew star.
J. Comb. Theory, Ser. B 96(3): 352-366 (2006) |
| 2005 |
|---|
| 44 | EE | Alain Hertz,
David Schindl,
Nicolas Zufferey:
Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints.
4OR 3(2): 139-161 (2005) |
| 2004 |
|---|
| 43 | EE | Michel Gendreau,
Alain Hertz,
Frédéric Semet,
Marino Widmer:
Preface.
Discrete Applied Mathematics 145(1): 1-2 (2004) |
| 2003 |
|---|
| 42 | EE | Tamás Kis,
Alain Hertz:
A Lower Bound for the Job Insertion Problem.
Discrete Applied Mathematics 128(2-3): 395-419 (2003) |
| 41 | EE | Michael U. Gerber,
Alain Hertz,
David Schindl:
P5-free augmenting graphs and the maximum stable set problem.
Discrete Applied Mathematics 132(1-3): 109-119 (2003) |
| 40 | EE | Michael U. Gerber,
Alain Hertz,
Vadim V. Lozin:
Stable sets in two subclasses of banner-free graphs.
Discrete Applied Mathematics 132(1-3): 121-136 (2003) |
| 39 | EE | Alain Hertz,
Marino Widmer:
Guidelines for the use of meta-heuristics in combinatorial optimization.
European Journal of Operational Research 151(2): 247-252 (2003) |
| 38 | EE | Cédric Avanthay,
Alain Hertz,
Nicolas Zufferey:
A variable neighborhood search for graph coloring.
European Journal of Operational Research 151(2): 379-388 (2003) |
| 37 | EE | Alain Hertz,
Vadim V. Lozin,
David Schindl:
Finding augmenting chains in extensions of claw-free graphs.
Inf. Process. Lett. 86(6): 311-316 (2003) |
| 2002 |
|---|
| 36 | EE | Francine Herrmann,
Alain Hertz:
Finding the Chromatic Number by Means of Critical Graphs.
ACM Journal of Experimental Algorithmics 7: 10 (2002) |
| 35 | EE | Michael U. Gerber,
Pierre Hansen,
Alain Hertz:
Extension of Turán's Theorem to the 2-Stability Number.
Graphs and Combinatorics 18(3): 479-489 (2002) |
| 34 | | Marie-Christine Costa,
Alain Hertz,
Michel Mittaz:
Bounds and Heuristics for the Shortest Capacitated Paths Problem.
J. Heuristics 8(4): 449-465 (2002) |
| 2001 |
|---|
| 33 | EE | Michael U. Gerber,
Alain Hertz:
A Transformation Which Preserves the Clique Number.
J. Comb. Theory, Ser. B 83(2): 320-330 (2001) |
| 2000 |
|---|
| 32 | EE | Dominique de Werra,
Alain Hertz,
Daniel Kobler,
Nadimpalli V. R. Mahadev:
Feasible edge colorings of trees with cardinality constraints.
Discrete Mathematics 222(1-3): 61-72 (2000) |
| 31 | EE | Francine Herrmann,
Alain Hertz:
Finding the chromatic number by means of critical graphs.
Electronic Notes in Discrete Mathematics 5: 174-176 (2000) |
| 1999 |
|---|
| 30 | EE | Jacques Carlier,
Alain Hertz,
Frédéric Maffray,
Marino Widmer:
Preface.
Discrete Applied Mathematics 94(1-3): 1 (1999) |
| 29 | EE | Alain Hertz:
On Perfect Switching Classes.
Discrete Applied Mathematics 94(1-3): 3-7 (1999) |
| 28 | EE | Jacek Blazewicz,
Alain Hertz,
Daniel Kobler,
Dominique de Werra:
On some Properties of DNA Graphs.
Discrete Applied Mathematics 98(1-2): 1-19 (1999) |
| 27 | EE | Dominique de Werra,
Alain Hertz:
On perfectness of sums of graphs.
Discrete Mathematics 195(1-3): 93-101 (1999) |
| 26 | | Patrice Calégari,
Giovanni Coray,
Alain Hertz,
Daniel Kobler,
Pierre Kuonen:
A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization.
J. Heuristics 5(2): 145-158 (1999) |
| 25 | EE | Shoshana Anily,
Julien Bramel,
Alain Hertz:
A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems.
Oper. Res. Lett. 24(1-2): 29-35 (1999) |
| 1998 |
|---|
| 24 | EE | Alain Hertz:
On Perfect Switching Classes.
Discrete Applied Mathematics 89(1-3): 263-267 (1998) |
| 1997 |
|---|
| 23 | EE | Alain Hertz:
On the Use of Boolean Methods for the Computation of the Stability Number.
Discrete Applied Mathematics 76(1-3): 183-203 (1997) |
| 22 | EE | Pierre Hansen,
Alain Hertz,
Nicolas Quinodoz:
Splitting trees.
Discrete Mathematics 165-166: 403-419 (1997) |
| 1996 |
|---|
| 21 | EE | Michel Gendreau,
Alain Hertz,
Gilbert Laporte:
The Traveling Salesman Problem with Backhauls.
Computers & OR 23(5): 501-508 (1996) |
| 20 | EE | Alain Hertz,
Maurice Queyranne,
Marino Widmer:
Preface.
Discrete Applied Mathematics 65(1-3): 1-3 (1996) |
| 19 | EE | Alain Hertz,
Yves Mottet,
Yves Rochat:
on a Scheduling Problem in a Robotized Analytical System.
Discrete Applied Mathematics 65(1-3): 285-318 (1996) |
| 18 | EE | Alain Hertz,
Marino Widmer:
An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints.
Discrete Applied Mathematics 65(1-3): 319-345 (1996) |
| 1995 |
|---|
| 17 | | Vincent Robert,
Alain Hertz:
How to Decompose Constrained Course Scheduling Problems into Easier Assignment Type Subproblems.
PATAT 1995: 364-373 |
| 16 | EE | Alain Hertz:
Polynomially Solvable Cases for the Maximum Stable Set Problem.
Discrete Applied Mathematics 60(1-3): 195-210 (1995) |
| 1994 |
|---|
| 15 | | Alain Hertz,
Brigitte Jaumard,
Marcus Poggi de Aragão:
Local Optima Topology for the k-Coloring Problem.
Discrete Applied Mathematics 49(1-3): 257-280 (1994) |
| 14 | | Alain Hertz,
Brigitte Jaumard,
Celso C. Ribeiro:
A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing.
Discrete Applied Mathematics 50(3): 255-265 (1994) |
| 13 | | Alain Hertz:
A New Polynomial-Time Algorithm for the Maximum Weighted (\chi(G) - 1)-Coloring Problem in Comparability Graphs.
Mathematical Systems Theory 27(4): 357-363 (1994) |
| 1993 |
|---|
| 12 | EE | Pierre Hansen,
Alain Hertz,
Julio Kuplinsky:
Bounded vertex colorings of graphs.
Discrete Mathematics 111(1-3): 305-312 (1993) |
| 1992 |
|---|
| 11 | EE | Dominique de Werra,
Alain Hertz:
Foreword.
Discrete Applied Mathematics 35(3): 175-176 (1992) |
| 10 | EE | Alain Hertz:
Finding a feasible course schedule using Tabu search.
Discrete Applied Mathematics 35(3): 255-270 (1992) |
| 1990 |
|---|
| 9 | EE | Patrick Brézillon,
Dong-Yih Bau,
Alain Hertz,
A. P. Fauquembergue Maizener:
Elaboration of the SEPT Expert System as the Coupling of a Simulator and a Diagnostician.
IEA/AIE (Vol. 1) 1990: 54-60 |
| 8 | | Alain Hertz,
Dominique de Werra:
The Tabu Search Metaheuristic: How we used it.
Ann. Math. Artif. Intell. 1: (1990) |
| 7 | EE | Charles Friden,
Alain Hertz,
Dominique de Werra:
Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph.
Computers & OR 17(5): 437-445 (1990) |
| 6 | EE | Alain Hertz:
A fast algorithm for coloring Meyniel graphs.
J. Comb. Theory, Ser. B 50(2): 231-240 (1990) |
| 1989 |
|---|
| 5 | EE | Alain Hertz,
Dominique de Werra:
Foreword.
Discrete Mathematics 74(1-2): 1-2 (1989) |
| 4 | EE | Alain Hertz,
Dominique de Werra:
Connected sequential colorings.
Discrete Mathematics 74(1-2): 51-59 (1989) |
| 1988 |
|---|
| 3 | EE | Alain Hertz,
Dominique de Werra:
Perfectly orderable graphs are quasi-parity graphs: a short proof.
Discrete Mathematics 68(1): 111-113 (1988) |
| 2 | EE | Alain Hertz:
Bipartable graphs.
J. Comb. Theory, Ser. B 45(1): 1-12 (1988) |
| 1986 |
|---|
| 1 | EE | Alain Hertz:
Quelques utilisations de la struction.
Discrete Mathematics 59(1-2): 79-89 (1986) |
