List of Publications

1. Refereed journal publications

1.           R. Randel, D. Aloise, S.J. Blanchard, A. Hertz, accepted September 2021, “A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering”, to appear in Data Mining and Knowledge Discovery.

2.           A. Hertz, accepted August 2021, Decycling bipartite graphs”, to appear in Journal of Graph Algorithms and Applications.

3.           C. Cantardo, A. Hertz, accepted May 2021, An exact algorithm for a class of geometric set-cover problems”, to appear in Discrete Applied Mathematics.

4.           A. Hertz, T. Kuflik, N. Tuval, 2021, “Resolving sets and integer programs for recommender systems”, Journal of Global Optimization, doi.org/10.1007/s10898-020-00982-0

5.           C. Bentz, M.C. Costa, A. Hertz, 2020, “On the edge capacitated Steiner tree problem”, Discrete Optimization 38, doi.org/10.1016/j.disopt.2020.100607

6.           R. Bürgy, A. Hertz, P. Baptiste, 2020, “An exact dymamic programming algorithm for the precedence-constrained class sequencing problem”, Computers & Operations Research 124, doi.org/10.1016/j.cor.2020.105063

7.           A. Hertz, T. Ridremont, 2020, “A Tabu Search for the Design of Capacitated Rooted Survivable Planar Networks”, Journal of Heuristics 26, 829-850.

8.           A. Hertz, C. Picouleau, 2019, “On graceful difference labelings of disjoint unions of circuits”, Open Journal of Discrete Applied Mathematics (ODAM) 2(3):38-55.

9.           G. Devillez, A. Hertz, H. Mélot, P. Hauwelle, 2019, “Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices”, Yugoslav Journal of Operations Research 29(2), 193-202.

10.        P. Hauwelle , A. Hertz, H. Mélot, B. Ries, G. Devillez, 2019, “Maximum Eccentric Connectivity Index for Graphs with Given Diameter”, Discrete Applied Mathematics 268:102-111.

11.        A. Hertz, R. Montagné, F. Gagnon, 2018, “A Comparison of integer programming models for the partial directed weighted improper coloring problem”, Discrete Applied Mathematics, https://doi.org/10.1016/j.dam.2018.08.026

12.        P. Hansen, M. Aouchiche, G. Caporossi, A. Hertz, C. Sellal, 2018, “Mixed Integer Programming and Extremal Chemical Graphs”, International Journal of Chemistry and Chemical Engineering Systems, 3:22-30

13.        A. Hertz, R. Montagné, F. Gagnon, 2017, “Online algorithms for the maximum k-colorable subgraph problem”, Computers & Operations Research, https://doi.org/10.1016/j.cor.2017.10.003

14.        A. Hertz, V. Lozin, B. Ries, V. Zamaraev, D. de Werra, 2017, “Dominating induced matchings in graphs containing no long claw”, Journal of Graph Theory, https://doi.org/10.1002/jgt.22182

15.        R. Bürgy, P. Baptiste, A. Hertz, D. Rebaïne, A. Linhares, 2017, “A stochastic online algorithm for unloading boxes from a conveyor line”, Flexible Services and Manufacturing, https://doi.org/10.1007/s10696-017-9291-9

16.        P. Hansen, A. Hertz, C. Sellal, D. Vukičević, M. Aouchiche, G. Caporossi, 2017, “Edge realizability of connected simple graphs”, MATCH Communications in Mathematical and in Computer Chemistry 78:689-712.

17.        A. Rybarczyk, A. Hertz, M. Kasprzak, J. Blazewicz, 2017, “Tabu Search for the RNA Partial Degradation Problem”, International Journal of Applied Mathematics and Computer Science 27:401-415.

18.        A. Hertz, 2017, An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes, Optimization Letters, https://doi.org/10.1007/s11590-017-1184-z

19.        S. Altinakar, A. Hertz, G. Caporossi, 2017, “Symmetry Breaking Constraints for the Minimum Deficiency Problem”, Journal of Graph Algorithms and Applications 21(2):195-218.

20.        R. Montagné, A. Hertz, F. Gagnon, 2017, “A multi-cell graph based dynamic resource allocation scheme for multi-user wireless networks”, AEU-International Journal of Electronics and Communications 76:60-70.

21.       P. Baptiste, R. Bürgy, A. Hertz, D. Rebaïne, 2017, “Online heuristics for unloading boxes off a gravity conveyor”, International Journal of Production Research 55(11):3046-3057.

22.        M. Adgbindin, A. Hertz, M. Bellaïche, 2016, A new efficient RLF-like algorithm for the vertex coloring problem”, Yugoslav Journal of Operations Research 26(4):441-446.

23.        A. Hertz, O. Marcotte, A. Mdimagh, M. Carreau, F. Welt, 2016, “On the design of a wind farm collection network when several cable types are available”, Journal of the Operational Research Society, doi:10.1057/s41274-016-0021-6

24.        R. Absil, É. Camby, A. Hertz, H. Mélot, 2016, “A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n-3”, Discrete Applied Mathematics, http://dx.doi.org/10.1016/j.dam.2016.06.025

25.        A. Hertz, R. Montagné, F. Gagnon, 2016, “Constructive algorithms for the partial directed weighted improper coloring problem”, Journal of Graph Algorithms and Applications 20, 159-188.

26.        A. Hertz, “Dessine-moi un graphe”, 2016, Accromath 11, 8-13.

27.        A. Hertz, H. Mélot, accepted September 2016, Counting the number of non-equivalent vertex colorings of a graph”, Discrete Applied Mathematics, http://dx.doi.org/10.1016/j.dam.2015.09.015

28.        S. Altinakar, A. Hertz, G. Caporossi, 2016, A comparison of integer and constraint programming models for the deficiency problem”, Computers & Operations Research 68, 89-96.

29.        J. Blazewicz, A. Hertz, C. Picouleau, M. Widmer, 2015, « Foreword » Discrete Applied Mathematics 182, 1.

30.        C. Archetti, N. Bianchessi, A. Hertz, A. Colombet, F. Gagnon, 2015, « Directed weighted improper coloring for cellular channel allocation » Discrete Applied Mathematics 182, 46-60.

31.        A. Hertz, B. Ries, 2014, “A note on r-equitable k-colorings of trees”, Yugoslav Journal of Operations Research 24/2, 293-298.

32.        A. Hertz, O. Marcotte, D. Schindl, 2014, “On the maximum orders of an induced forest, an induced tree, and a stable set”, Yugoslav Journal of Operations Research 24/2, 199-215.

33.        C. Desrosiers, P. Galinier, P. Hansen, A. Hertz, 2014, Automated generation of conjectures on forbidden subgraph characterization”, Discrete Applied Mathematics 162, 177-194.

34.        C. Archetti, N. Bianchessi, A. Hertz, M.G. Speranza, 2014, “The Split Delivery Capacitated Team Orienteering Problem”, Networks, 63/1, 16-33.

35.        C. Archetti, N. Bianchessi, A. Hertz, M.G. Speranza, 2014, “Incomplete Service and Split Deliveries in a Routing Problem with Profits”, Networks, 63/2, 135-145..

36.        C. Archetti, N. Bianchessi, A. Hertz, 2014, “A branch-and-price algorithm for the robust graph coloring problem”, Discrete Applied Mathematics, 165, 49-59.

37.        P. Baptiste, A. Hertz, A. Linhares, D. Rebaine, 2013, « A polynomial time algorithm for unloading boxes off a gravity conveyor », Discrete Optimization 10, 251-262.

38.        A. Hertz, 2012, “L’enseignement de la théorie des graphes à l’aide d’intrigues policières”, Bulletin de l’APMEP 499, 290-296.

39.        P. St-Louis, B. Gendron, A. Hertz, 2012, Total Domination and the Caccetta-Häggkvist Conjecture”, Discrete Optimization 9/4, 236-240.

40.        A. Hertz, M. Uldry, M. Widmer, 2012, “Integer Linear Programming Models for a Cement Delivery Problem”, European J. of Operational Research 222/3, 623-631.

41.        A. Hertz, O. Marcotte, A. Mdimagh, M. Carreau, F. Welt, 2012, “Optimizing the Design of a Wind Farm Collection Network”, INFOR 50:2, 95-104.

42.        C. Archetti, L. Bertazzi, A. Hertz, M.G. Speranza, 2012, “A hybrid heuristic for an inventory-routing problem”, INFORMS Journal on Computing 24:1,101-116.

43.        S. Altinakar, G. Caporossi, A. Hertz, 2011, “On compact k-edge-colorings : a polynomial time reduction from linear to cyclic”, Discrete Optimization 8:3, 502-512.

44.        P. Galinier, A. Hertz, S. Paroz, G. Pesant, 2011, “Using local search to speed up filtering algorithms for some NP-Hard constraints”, Annals of Operations Research 184:1, 121-135.

45.        M. Bouchard, M. Čangalović, A. Hertz, 2010, “On a reduction of the interval coloring problem to a series of bandwidth coloring problems”, Journal of Scheduling 13, 583-595.

46.        A. Hertz, R. Razanakoto, 2010, “Confection de calendriers de matchs pour le sport universitaire et collégial au Québec”, INFOR 48, 181-189.

47.        C. Desrosiers, P. Galinier, P. Hansen, A. Hertz, 2011, “Improving constrained pattern mining with first-fail-based heuristics”, Data Mining and Knowledge Discovery, 23:1, 63-90.

48.        A. Hertz, N. Lahrichi, M. Widmer, 2010, “A flexible MILP model for multiple-shift workforce planning under annualized hours”, European Journal of Operational Research 200, 860-873.

49.        C. Archetti, D. Feillet, A. Hertz, M.G. Speranza, 2010, “The undirected capacitated arc routing problem with profits”, Computers & Operations Research 37, 1860-1869.

50.        A. Hertz, D. de Werra, 2009, “A magnetic procedure for the stability number”, Graphs and Combinatorics 25, 707-716.

51.        C. Archetti, D. Feillet, A. Hertz, M.G. Speranza, 2009, “The Capacitated Team Orienteering and Profitable Tour Problems”, Journal of the Operational Research Society 60, 831-842.

52.        L.M. Gambardella, A. Hertz, F. Maffray, M. Widmer, 2009, Sixth International Conference on Graphs and Optimization 2007: Foreword, Discrete Applied Mathematics 157(17), 3495-3496.

53.        M. Bouchard, M. Čangalović, A. Hertz, 2009, “About equivalent interval colorings of weighted graphs”, Discrete Applied Mathematics 157, 3615-3624.

54.        A. Hertz, D. Schindl, N. Zufferey, 2009, “A Solution Method for a Car Fleet Management Problem with Maintenance Constraints”, Journal of Heuristics, 15, 425-450.

55.        C. Desrosiers, P. Galinier, A. Hertz, S. Paroz, 2009, Using Meta-heuristics to Find Minimal Unsatisfiable Subformulas in Satisfiability Problems”, Journal of Combinatorial Optimization 18, 124-150.

56.        M. Bouchard, A. Hertz, G. Desaulniers, 2009, Lower bounds and a tabu search algorithm for the minimum deficiency problem”, Journal of Combinatorial Optimization 17, 168-191.

57.        A. Hertz, M. Plumettaz, N. Zufferey, 2009, Corrigendum to <Variable Space Search for Graph Coloring>, Discrete Applied Mathematics 157 (7), 1335-1336.

58.        A.-S. Pepin, G. Desaulniers, A. Hertz, D. Huisman, 2009, “Comparison of Heuristic Approaches for the Multiple Depot Vehicle Scheduling Problem”, Journal of Scheduling 12(1), 17-30.

59.        A. Hertz, N. Lahrichi, 2008, “A Patient Assignment Algorithm for Home Care Services”, Journal of the Operational Research Society 60, 481-495.

60.        P. Hansen, A. Hertz, R. Kilani, O. Marcotte, D. Schindl, 2008, Average distance and maximum induced forest”, Journal of Graph Theory 60 (1), 31-54.

61.        D. de Werra, E. Boros, J. Carlier, A. Hertz, M. Widmer, 2008, Fifth International Conference on Graphs and Optimization 2006 : Foreword, Discrete Applied Mathematics 156, 2437-2438.

62.        A. Hertz, M. Plumettaz, N. Zufferey, 2008, Variable Space Search for Graph Coloring”, Discrete Applied Mathematics 156 (13), 2551-2560.

63.        A. Hertz, S. Varone, 2008, “The Metric Cutpoint Partition Problem”, Journal of Classification 25:2, 159-175.

64.        P. Galinier, A. Hertz, S. Paroz, G. Pesant, 2008, “Using local search to speed up filtering algorithms for some NP-Hard constraints”, in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science 5015, 298,-302, Springer Berlin / Heidelberg.

65.        B. Gendron, A. Hertz, P. St-Louis, 2008, A Sequential Elimination Algorithm for Computing Bounds on the Clique Number of a Graph”, Discrete Optimization 5, 615-628.

66.        B. Gendron, A. Hertz, P. St-Louis, 2008, On a Generalization of the Gallai-Roy-Vitaver Theorem to the Bandwidth Coloring Problem”, Operations Research Letters 36, 345-350.

67.        C. Desrosiers, P. Galinier, A. Hertz, 2008, “Efficient Algorithms for Finding Critical Subgraphs”, Discrete Applied Mathematics 156, 244-266.

68.        P. Galinier, A. Hertz and N. Zufferey, 2008, "An adaptive Memory Algorithm for the k-Colouring Problem”, Discrete Applied Mathematics 156, 267-279.

69.        A. Hertz, S. Varone, 2007, “The Metric Bridge Partition Problem : partitioning of a metric space into two subspaces linked by an edge in any optimal realization”, Journal of Classification 24, 235-249.

70.        C. Archetti, A. Hertz, M.G. Speranza, 2007, "Metaheuristics for the Team Orienteering Problem", Journal of Heuristics 13, 49-76.

71.        A. Hertz, S. Varone, 2007, “A note on tree realizations of matrices”, RAIRO-Operations Research 41, 361-366.

72.        M. Gamache, A. Hertz, J. Ouellet, 2007, “A graph coloring model for a feasibility problem in crew scheduling”, Computers & Operations Research 34, 2384-2395.

73.        B. Gendron, A. Hertz and P. St-Louis, 2007, "On edge orienting methods for graph coloring", Journal of Combinatorial Optimization 13, 163-178.

74.        P. Galinier and A. Hertz, 2007, “Solution Techniques for the Large Set Covering Problem”, Discrete Applied Mathematics 155, 312-326.

75.        N. Lahrichi, A. Hertz, S.D. Lapierre, A. Talib, L. Bouvier, 2006, “Analysis of a territorial approach to the delivery of nursing home care services based on historical data”, Journal of Medical Systems 30/4, 283-291.

76.        M.U. Gerber, A. Hertz and V.V. Lozin, 2006, “Finding Augmenting Chains in Graphs without a Skew Star”, Journal of Combinatorial Theory, Series B 96, 352-366.

77.        P. Galinier, A. Hertz, 2006, “A Survey of Local Search Methods for Graph Coloring”, Computers & Operations Research 33, 2547-2562.

78.        M. Gendreau, A. Hertz, 2006, "Editorial : Anniversary focused issue of Computers & Operations Research on tabu search", Computers & Operations Research 33, 2447-2448.

79.        C. Archetti, A. Hertz, M.G. Speranza, 2006, "A tabu search algorithm for the split delivery vehicle routing problem", Transportation Science 40/1, 64-73.

80.        A. Hertz, 2005, “Les métaheuristiques : quelques conseils pour en faire bon usage”, in "Gestion de Production et Ressources Humaines : méthodes de planification dans les systèmes productifs", Presses Internationales de Polytechnique, 205-222.

81.        A. Hertz, 2005, "Recent trends in arc routing", in "Graph Theory, Combinatorics and Algorithmics : Interdisciplinary Applications" (Eds I. Hartman and M. Golumbic), Kluwer, 215-236.

82.        A. Hertz, D. Schindl and N. Zufferey, 2005, "Lower Bounding and Tabu Search Procedures for the Frequency Assignment Problem with Polarization Constraints", 4OR 3/2, 139-161.

83.        A. Hertz, V.V. Lozin, 2005, "The Maximum Independent Set Problem and Augmenting Graphs", in "Graph Theory and Combinatorial Optimization" (Eds D. Avis, A. Hertz, O. Marcotte), Springer, 69-99.

84.        J.-F. Cordeau, M. Gendreau, A. Hertz, G. Laporte, J.-S. Sormany,  2005, "New Heuristics for the Vehicle Routing Problem", in "Logistics Systems: Design and Optimization" (Eds A. Langevin and D. Riopel), Springer, 270-297.

85.        M. Gendreau, A. Hertz, F. Semet and M. Widmer, 2004, "Graph Optimization IV : Preface", Discrete Applied Mathematics 145, 1-2.

86.        M. Gerber, A. Hertz and D. Schindl, 2004, "P5-free augmenting graphs and the maximum stable set problem", Discrete Applied Mathematics 132, 109-119.

87.        M. Gerber, A. Hertz and V. Lozin, 2004, "Stable sets in two subclasses of banner-free graphs", Discrete Applied Mathematics 132, 121-136.

88.        A. Hertz and M. Widmer, 2003, "Guidelines for the use of meta-heuristics in combinatorial optimization", European Journal of Operational Research 151, 247-252.

89.        C. Avanthay, A. Hertz and N. Zufferey, 2003, "A variable neighborhood search for graph coloring", European Journal of Operational Research 151, 379-388.

90.        T. Kis and A. Hertz, 2003, "A lower bound for the job insertion problem", Discrete Applied Mathematics 128, 395-419.

91.        A. Hertz, V. Lozin and D. Schindl, 2003, "Finding augmenting chains in extensions of claw-free graphs", Information Processing Letters 86/6, 311-316.

92.        F. Herrmann and A. Hertz, 2002, "Finding the chromatic number by means of critical graphs", ACM Journal of Experimental Algorithmics 7/10, 1-9.
( Errata: Five lines are missing in the published versions of Table 2 of the paper. Here is a PDF version containing the full Table)

93.        M. Gerber, P. Hansen and A. Hertz, 2002, "Extension of Turan's Theorem to the 2- Stability Number", Graphs and Combinatorics 18/3, 479-489.

94.        M.-C. Costa, A. Hertz and M. Mittaz, 2002, "Bounds and Heuristics for the Shortest Capacitated Paths Problem", Journal of Heuristics 8, 449-465.

95.        G. Ghiani, A. Hertz and G. Laporte, 2002, "Recent algorithmic advances for arc routing problems"  Operations Research/Management Science at Work, E. Kozan and A. Ohuchi eds., Kluwer, Boston, 1-20.

96.        M.U. Gerber and A. Hertz, 2001, "A transformation which preserves the clique number", Journal of Combinatorial Theory, Series B 83, 320-330.

97.        A. Hertz and M. Mittaz, 2001, "A Variable Neighbourhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem", Transportation Science 35, 425-434.

98.        A. Hertz, D. Kobler, 2000, "A Framework for the description of Evolutionary algorithms", European J. of Operational Research 126, 1-12.

99.        A. Hertz, M. Mittaz, 2000, "Heuristic Algorithms", in Arc Routing: Theory, Solutions, and Applications (edited by M. Dror), Kluwer Academic Publishers, 327-386.

100.    D. de Werra, A. Hertz, D. Kobler, N.V.R: Mahadev, 2000, "Feasible edge colorings of trees with cardinality constraints", Discrete Mathematics 222, 61-72.

101.    A. Hertz, 2000, "On a transformation which preserves the stability number", Yugoslav Journal of Operations Research 10/1, 1-12.

102.    A. Hertz, G. Laporte, M. Mittaz, 2000, "A Tabu Search Heuristic for the Capacitated Arc Routing Problem", Operations Research 48, 129-135.

103.    A. Hertz, V. Robert, V. Berthod, 2000, "Planification des emplois du temps et de la formation au sein d'une grande entreprise", RAIRO-Operations Research 34, 61-83.

104.    A. Hertz, 1999, "On perfect switching classes", Discrete Applied Mathematics 94, 3-7.

105.    J. Carlier, A. Hertz, F. Maffray, M. Widmer, 1999, "Graphs and Optimization III Preface", Discrete Applied Mathematics 94, 1.

106.    J. Blazewicz, A. Hertz, D. Kobler, D. de Werra, 1999, "On some properties of DNA graphs", Discrete Applied Mathematics 98, 1-19.

107.    P. Calegari, G. Coray, A. Hertz, D. Kobler, P. Kuonen, 1999, "A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization", Journal of Heuristics 5, 145-158.

108.    S. Anily, J. Bramel, A. Hertz, 1999, "A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems", Operations Research Letters 24, 29-35. 

109.    A. Hertz, G. Laporte, P. Nanchen, 1999, "Improvement Procedure for the Undirected Rural Postman Problem", INFORMS Journal on Computing 11, 53-62.

110.    D. de Werra, A. Hertz, 1999, "On Perfectness of Sums of Graphs", Discrete Mathematics 195, 93-101.

111.    M. Gendreau, A. Hertz, G. Laporte, M. Stan, 1998, "A generalized insertion heuristic for the traveling salesman problem with time windows", Operations Research 43, 330-335.

112.    A. Hertz, 1998, "On perfect switching classes", Discrete Applied Mathematics 89, 263-267.

113.    A. Hertz, V. Robert, 1998, "Constructing a course schedule by solving a series of assignment problems", European J. of Operational Research 108, 585-603.

114.    A. Hertz, G. Laporte, M. Mittaz, K.E. Stecke, 1998, "Heuristics for Minimizing Tool Switches Over Time on a Flexible Machine", IIE Transactions 30/8, 689-694.

115.    M. Gendreau, A. Hertz, G. Laporte, 1997, "An approximation algorithm for the traveling salesman problem with backhauls", Operations Research 45, 639-641.

116.    D. Costa, A. Hertz, 1997, "Ants can colour graphs", Journal of the Operational Research Society 48, 295-305.

117.    A. Hertz, 1997, "On the use of Boolean methods for the computation of the stability number", Discrete Applied Mathematics 76, 183-203.

118.    J. Blazewicz, J. Carlier, A. Hertz, M. Widmer, 1997, "Graphs and Optimization II : Preface", Discrete Applied Mathematics 76, 1-2.

119.    P. Hansen, A. Hertz, N. Quinodoz, 1997, "Splitting trees", Discrete Mathematics 165/166, 403-419.

120.    A. Hertz, 1997, "A Colourful Look on Evolutionary Techniques", Belgian Journal of Operation Research 35, 23-39.

121.    M. Gendreau, A. Hertz, G. Laporte, 1996, "The Traveling Salesman Problem with Backhauls", Computers & Operations Research 23, 501-508.

122.    J. Ferland, A. Hertz, A. Lavoie, 1996, "An object oriented methodology for solving assignment type problems with neighborhood search techniques", Operations Research. 44/2, 347-359.

123.    A. Hertz, Y. Mottet, Y. Rochat, 1996, "On a scheduling problem in a robotized analytical system", Discrete Applied Mathematics 65, 285-318.

124.    A. Hertz, M. Widmer, 1996, "An improved tabu search approach for solving the job shop scheduling problem with tooling constraints", Discrete Applied Mathematics 65, 319-346.

125.    A. Hertz, M. Queyranne, M. Widmer, 1996, "First Int. Colloq. on Graphs and Optimization (GO I) : Preface", Discrete Applied Mathematics 65, 1-3.

126.    D. de Werra, A. Hertz, 1995, "A partial view of OR in Switzerland", European J. of Operational Research 87, 471-473.

127.    D. Costa, A. Hertz, O. Dubuis, 1995, "Embedding of a sequential procedure within an evolutionary algorithm for coloring problems in graphs", Journal of Heuristics 1, 105-128.

128.    A. Hertz, M. Widmer, 1995, "La méthode tabou appliquée aux problèmes d'ordonnancement", RAIRO- Automatique, Productique, Informatique Industrielle (Automatic Control Production Systems) 29/4 and 5, 353-378.

129.    A. Hertz, 1995, “ Polynomially Solvable Cases for the Maximum Stable Set Problem”, Discrete Applied Mathematics 60, 195-210.

130.    M. Gendreau, A. Hertz, G. Laporte, 1994, "A Tabu Search Heuristic for the Vehicle Routing Problem", Management Science 40/10, 1276-1290.

131.    A. Hertz, B. Jaumard, C.C. Ribeiro, W.P. Formosinho Filho, 1994, "A Multi- Criteria Tabu Search Approach to Cell Formation Problems in Group Technology with Multiple Objectives", RAIRO/Recherche Opérationnelle 28/3, 303-328.

132.    A. Hertz, 1994, "A new polynomial time algorithm for the maximum weighted (c(G)-1)-coloring problem in comparability graphs", Mathematical Systems Theory 27, 357-363.

133.    A. Hertz, B. Jaumard, C.C. Ribeiro, 1994, "A Graph Theory Approach to Subcontracting, Machine Duplication and Intercell Moves in Cellular Manufacturing", Discrete Applied Mathematics 50, 255-265.

134.    M. Gendreau, A. Hertz, G. Laporte, 1994, "A generalized insertion algorithm for the seriation problem", Mathematical Comput. Modelling 19/9, 53-59.

135.    A. Hertz, B. Jaumard, M. Poggi de Aragao, 1994, "Local Optima Topology for the k- Coloring Problem", Discrete Applied Mathematics 49, 257-280.

136.    A. Hertz, 1993, "Most unbreakable murky graphs are bull-free", Graphs and Combinatorics 9, 173-175.

137.    P. Hansen, A. Hertz, J. Kuplinsky, 1993, "Bounded Vertex Colorings of Graphs", Discrete Mathematics 111, 305-312.

138.    A. Hertz, D. de Werra, 1993, "On the stability number of AH-free graphs", Journal of Graph Theory 17/1, 53-63.

139.    M. Gendreau, A. Hertz, G. Laporte, 1992, "New insertion and post-optimization procedures for the traveling salesman problem", Operations Research 40/6, 1086-1094.

140.    A. Hertz, 1992, "Finding a feasible course schedule using tabu search", Discrete Applied Mathematics 35, 255-270.

141.    D. de Werra, A. Hertz, 1992, Foreword to “Timetabling and Chromatic Scheduling”, Discrete Applied Mathematics 35, 175-176.

142.    A. Hertz, 1991, "COSINE: a new graph coloring algorithm", Operations Research Letters 10, 411-415.

143.    A. Hertz, 1991, "Tabu search for large scale timetabling problems", European Journal of Operational Research 54/1, 39-47.

144.    A. Hertz, 1990, "A fast algorithm for coloring Meyniel graphs", J. of Combinatorial Theory, Series B 50, 231-240.

145.    A. Hertz, D. de Werra, 1990, "The tabu search metaheuristic: how we used it", Annals of Mathematics and Artificial Intelligence 1,111-121.

146.    C. Friden, A. Hertz, D. de Werra, 1990, "TABARIS: an exact algorithm based on tabu search for finding a maximum independent set in a graph", Computers and Operations Research 17, 437-445.

147.    A. Hertz, 1990, "Bipolarizable Graphs", Discrete Mathematics 81, 25-32.

148.    A. Hertz, 1989, "Skeletal Graphs: a new class of perfect graphs", Discrete Mathematics 78, 291-296.

149.    A. Hertz, 1989, "Slender Graphs", J. of Combinatorial Theory, Series B 47, 231- 236.

150.    D. de Werra, A. Hertz, 1989, "Tabu search: a tutorial and an application to neural networks", OR Spektrum 11, 131-141.

151.    M. Widmer, A. Hertz, 1989, "A new heuristic method for the flow shop sequencing problem", European J. of Operational Research 41, 186-193.

152.    C. Friden, A. Hertz, D. de Werra, 1989, "STABULUS: a technique for finding stable sets in large graphs with tabu search", Computing 42, 35-44.

153.    A. Hertz, 1989, "Slim Graphs", Graphs and Combinatorics 5, 149-157.

154.    A. Hertz, D. de Werra, 1989, "Connected sequential colorings", Discrete Mathematics 74, 51-59.

155.    A. Hertz, 1989, "Bipartable Graphs", J. of Combinatorial Theory, Series B 45, 1- 12.

156.    D. de Werra, A. Hertz, 1988, "Consecutive colorings of graphs", Z.O.R. 32, 1-8.

157.    A. Hertz, D. de Werra, 1988, "Perfectly orderable graphs are quasi-parity graphs: a short proof", Discrete Mathematics 68, 111-113.

158.    A. Hertz, D. de Werra, 1987 , "Using tabu search for graph coloring", Computing 39, 345-351.

159.    M. Chams, A. Hertz, D. de Werra, 1987, "Some experiments with simulated annealing for coloring graphs", European J. of Operational Research 32, 260-266.

160.    A. Hertz, 1986, "Quelques utilisations de la struction", Discrete Mathematics. 59, 79-89.


 

2. Books, Special issues of International Journals, Chapters in books

  1. A. Hertz, B. Ries, accepted June 2020, “Graph colouring variations”, to appear as Chapter 2 in the book Topics in Algorithmic Graph Theory (Ed. M.C. Golumbic), Cambridge University Press.
  2. A. Hertz, “LA FRATERNITÉ DU VERSEAU – Une nouvelle enquête de l’Agrapheur”, Éditions Eaux Troubles, 2020, ISBM : 978-2940606405
  3. H.-S. Bécotte, G. Caporossi, A. Hertz, C. Leblay, 2019, “Writing and Rewriting: the Colored Mumerical Visualization of Keystroke Logging”, Chapter 4 of the book Observing Writing : Insights from Keystroke Logging and Handwriting (Eds Eva Lindgren and Kirk P.H. Sullivan), Koninklijke Brill NV, Leiden, pages 96-114.
  4. D. de Werra, A. Hertz, 2015, “ Chromatic Scheduling”, Chapter 12 of the book Topics in Chromatic Graph Theory (Eds L.W. Beineke and R.J. Wilson), Cambridge University Press. ISBN: 978-1-107-03350-4.
  5. A. Hertz, 2014, “GRAPHITI – L’Inspecteur Manori enquête à Paris”, Éditions Amalthée, ISBN: 978-2-310-01908-8.

6.     A. Hertz, 2012, Section 3.2 (pages 74-81) in the book Grafovi, Optimizacija, Hemija, Računarstvo : zapisi o radu jednog naučnog projekta (Graphs, Optimization, Chemistry, Computer Science : reports on the work of a scientific project), edited by D. Cvetković, T. Davidović, I. Gutman, V. Kovačević-Vujčić, Akademska misao, Beograd.

  1. A. Hertz, 2012, “Quick on the Draw : Crime-busting with a Mathematical Twist”, Presses Internationales Polytechnique, ISBN: 978-2-553-01626-4
  2. A. Hertz, 2011, “Der Graph der Graphen : Kriminalistische Verwicklungen mit mathematischer Pointe”, Vieweg+Teubner, Wiesbaden, Germany, ISBN: 978-3-8348-1814-0.
  3. A. Hertz, N. Zufferey, 2010, "Vertex Coloring Using Ant Colonies", Chapter 11 in “Artificial Ants : From Collective Intelligence to  Real-life Optimization and Beyond” (Eds N. Monmarché, F. Guinand, P. Siarry), Wiley, France, ISBN: 978-1-84821-194-0.
  4. A. Hertz, 2010, “L’agrapheur : intrigues policières à saveur mathématique”, Presses Internationales Polytechnique, ISBN: 978-2-553-01543-4.
  5. A. Hertz, N. Zufferey, 2009, "La coloration des sommets d’un graphe par colonies de fourmis", Chapter 11 in “Fourmis artificielles, des bases de l’optimisation aux applications industrielles” (Eds N. Monmarché, F. Guinand, P. Siarry), Hermes - Lavoisier, France, ISBN: 978-2-7462-2119-2.
  6. L.M. Gambardella, A. Hertz, F. Maffray, M. Widmer, 2009, éditeurs invités du numéro spécial Sixth International Conference on Graphs and Optimization 2007 de Discrete Applied Mathematics 157 (17).
  7. D. de Werra, E. Boros, J. Carlier, A. Hertz, M. Widmer, 2008, éditeurs invités du numéro spécial Fifth International Conference on Graphs and Optimization in honour of Peter Hammer’s and Jakob Krarup’s 70th birthdayGO V, 2006, Graphs and Optimization, 5th Conference de Discrete Applied Mathematics 156 (13).
  8. A. Hertz and M. Mittaz, 2008, "Pickup and delivery problems with services on nodes or arcs of a network", Chapter 6 of the book Operations Research and Networks (Ed. G. Finke), Wiley, 165-188.
  9. M. Widmer, A. Hertz, D. Costa, 2008, “ Metaheuristics and Scheduling” Chapter 3 of the book Production Scheduling (Eds P. Lopez and F. Roubellat), Wiley, 33-68.
  10. M. Gendreau, A. Hertz, 2006, Editors of "Anniversary Focused Issue of Computers & Operations Research on Tabu Search", Computers & OR 33/9, Elsevier.
  11. A. Hertz, 2005, “Les métaheuristiques : quelques conseils pour en faire bon usage”, Chapter 9 in "Gestion de Production et Ressources Humaines : méthodes de planification dans les systèmes productifs", Presses Internationales de Polytechnique, 205-222.
  12. A. Hertz, 2005, "Recent trends in arc routing", Chapter 9 in Graph Theory, Combinatorics and Algorithmics : Interdisciplinary Applications (Eds I. Hartman and M. Golumbic), Kluwer, 215-236.
  13. A. Hertz, O. Marcotte, 2005, Editors of "Optimization Days 2003", Computers & OR 33/4, Elsevier.
  14. D. Avis, A. Hertz, O. Marcotte, 2005, Editors of "Graph Theory and Combinatorial Optimization", Springer.
  15. A. Hertz, V.V. Lozin, 2005, "The Maximum Independent Set Problem and Augmenting Graphs", Chapter 4 in "Graph Theory and Combinatorial Optimization" (Eds D. Avis, A. Hertz, O. Marcotte), Springer, 69-99.
  16. J.-F. Cordeau, M. Gendreau, A. Hertz, G. Laporte, J.-S. Sormany,  2005, "New Heuristics for the Vehicle Routing Problem", Chapter in "Logistics Systems: Design and Optimization" (Eds A. Langevin and D. Riopel), Springer, 279-297.
  17. M. Gendreau, A. Hertz, F. Semet, M. Widmer, 2004, éditeurs invités du numéro spécial Graph Optimization IV de Discrete Applied Mathematics 145.
  18. A. Hertz, 2003, "Application des métaheuristiques à la coloration des sommets d'un graphe", Chapter 1 in Résolution de problèmes de RO par les métaheuristiques., Hermes Science Publication, Paris, 21-48.
  19. A. Hertz, M. Widmer, 2003, éditeurs invités du numéro spécial Meta-heuristics in Combinatorial Optimization de European Journal of Operational Research 151/2.
  20. A. Hertz and M. Mittaz, 2002, "Tournées de livraisons et de ramassages sur les noeuds ou les arcs d'un réseau", Chapter 6 in Recherche Opérationnelle et Réseaux : méthodes d’analyse spatiale, Hermes Science Publications, Paris, 167-189.
  21. A. Hertz, 2002, "Operations Research in Logistics", Chapter 10 in The Essential of Logistics and Management, Presses polytechniques et universitaires romandes (F.-L. Perret and C. Jaffeux, eds.), 253-279.
  22. A. Hertz, M. Mittaz, 2000, "Heuristic Algorithms", Chapter 9 of the book Arc Routing: Theory, Solutions, and Applications (edited by M. Dror)
  23. M. Widmer, A. Hertz, D. Costa, 2000, "Les Métaheuristiques", Chapter 3 of the book Ordonnancement de la Production, (Eds by P. Lopez and F. Roubellat),, Hermes Science Publications, 55-93.
  24. J. Carlier, A. Hertz, F. Maffray, M. Widmer, 1999, éditeurs invités du numéro spécial Proceedings of the Third International Conference on Graphs and Optimization GO-III de Discrete Applied Mathematics 94 issues 1-3.
  25. A. Hertz, E. Taillard, D. de Werra, 1997, "Tabu Search", chapitre du livre Local Search in Combinatorial Optimization (edité par E. Aarts and J.K. Lenstra), J. Wiley and Sons.
  26. J. Blazewicz, J. Carlier, A. Hertz, M. Widmer, 1997, éditeurs invités du numéro spécial Second International Colloquium on Graphs and Optimization de Discrete Applied Mathematics, 76 issues 1-3.
  27. A. Hertz, M. Queyranne, M. Widmer, 1996, éditeurs du numéro spécial First International Colloquium on Graphs and Optimization de Discrete Applied Mathematics 65 issues 1-3.
  28. A. Hertz, B. Jaumard, M. Labbe, D. de Werra, 1994, éditeurs de Special Volume Viewpoints on Optimization de Discrete Applied Mathematics 49, issues 1-3.
  29. D. de Werra, A. Hertz, 1992, éditeurs du numéro spécial Timetabling and Chromatic Scheduling de Discrete Applied Mathematics 35/3.
  30. D. de Werra, A. Hertz, 1989, éditeurs de "Graph Coloring and Variations", Annals of Discrete Mathematics 39.
  31. A. Hertz, 1989, "La coloration des sommets d'un graphe et son application à la confection d'horaires", thèse no. 785, DMA-EPF-Lausanne, Suisse.

 

3. Non refereed contributions or Proceedings

1.     N.Tuval, T. Kuflik, A. Hertz, 2019, Exploring the Potential of the Resolving Sets Model for Introducing Serendipity to Recommender Systems”, ACM UMAP 2019, Larnaca, Cyprus, June 2019.

2.     H.-S. Bécotte-Boutin, G. Caporossi, A. Hertz, C. Leblay, 2016, “ Analyse automatique des données scripturales prétraitées par des outils de visualisation”, SHS Web of Conferences 27, 06001 (Congrés Mondial de Linguistique Française – CMLF 2016, doi : 10.1051/shsconf/20162706001.

3.     P. Baptiste, A. Hertz, D. Rebaine, 2016, “ L’optimisation à l’interface entre production et logistique”, Bulletin du Gerad 13/1, 6-8.

  1. A. Hertz, B. Ries, 2011, “On r-equitable colorings of trees and forests”, cahier du Gerad G-2011-40.
  2. M. Uldry, M. Widmer, A. Hertz, 2011, “Two objective functions for a real life split delivery vehicle routing problem”, Proceedings of International Conference on Industrial Engineering and Systems Management IESM 2011, May 25-27, 1290-1299.
  3. M. Carreau, M. Morgenroth, O. Belashov, A. Mdimagh, A. Hertz, O. Marcotte, “Wind farm design optimization”, Proceedings of the XXIst World Energy Congress (WEC), Montréal, September 2010.
  4. C. Desrosiers, P. Galinier, P. Hansen, A. Hertz, 2009, Mining Graphs to Discover New Theorems in Mathematics, Proceedings of the MLG’09 conference (Mining and Learning with Graphs), Leuven, Belgium, July 2009.
  5. C. Desrosiers, P. Galinier, P. Hansen, A. Hertz, 2007, “SyGMA: Reducing Symmetry in Graph Mining”, cahier du Gerad G-2007-12.
  6. C. Desrosiers, P. Galinier, P. Hansen, A. Hertz, 2007, “Improving frequent subgraph mining in the presence of symmetry”, Proceedings of the MLG’07 conference (Mining and Learning with Graphs), Università degli Studi di Firenze, Italy, August 2007.
  7. A. Hertz and N. Zufferey, 2006, "A New Ant Algorithm for Graph Coloring", Proceedings of the Workshop on Nature Inspired Cooperative Strategies for Optimization, NICSO 2006, Granada, Spain, 51-60.
  8. P. Galinier, A. Hertz and N. Zufferey, 2002, "Adaptive Memory Algorithms for Graph Colouring", Proceedings of the COLOR2 Symposium, Ithaca, September 2002.
  9. L. Ghielmetti, A. Hertz, F. Lévy, N. Zufferey, 2000, "Modèles et algorithmes de prédictions pour les peptides antigéniques", Research Report, Project UNIL-EPFL, February 2000.
  10. I. Miconnet, C. Servis, L. Ghielmetti, N. Zufferey, J.-C. Cerottini, P. Romero, A. Hertz and F. Levy, 1999, "Amino acid identity and/or position determine proteasomal cleavage sites in vitro : implications for the generation of the HLA-A*0201-restricted peptide tumor antigen MAGE-3271-279 and development of a predictive mathematical algorithm."
  11. P. SoPasseig Joan de Borbó, 54lot, A. Hertz, T. Kis and L. Willmann, 1999, "Capacity optimization of multipurpose plants using batch simulation and evolutionary algorithms", Proceedings of the Interkama Chemputers Europe 5 Conference, Dusseldorf, October 21-23, 1999.
  12. M. Moreira, A. Hertz and E. Mayoraz, 1999, "Data Binarization by Discriminant Elimination", Proceedings of the ICML-99 Workshop: From Machine Learning to Knowledge Discovery in Databases, 51-60.
  13. A. Hertz, T. Kis, P. Xirouchakis, "Job shop scheduling with partial orders and machining alternatives", Research Report, ORWP 99/08, EPF-Lausanne, Switzerland, April 1999.
  14. A. Hertz, D. Kobler, "A Tabu Search for the Constrained Semi-Assignment Problem", Research Report, ORWP 99/06, EPF-Lausanne, Switzerland, February 1999.
  15. M.U. Gerber, P. Hansen, A. Hertz, "Local Optima Topology for the 3-SAT Problem"", Research Report, ORWP 98/10, EPF-Lausanne, Switzerland, November 1998.
  16. M.U. Gerber, P. Hansen. A. Hertz, U.N. Peled, D. de Werra, "Chopping graphs"", Research Report, ORWP 98/02, EPF-Lausanne, Switzerland, January 1998.
  17. A. Hertz, 1998, "No Suicide from the Swiss side" AIROnews III-3, 1-2.
  18. M. Widmer, B. Bugnon, S. Varone, A. Hertz, 1997, "Rythmed flow shop : how to balance the daily workload", Proceedings of the "IFAC/IFIP Conference on Management and Control of Production and Logistics (MCPL'97)", Campinas, Brazil
  19. R. Romanowicz, J. Jacot, A. Hertz, E. Verdebout, 1997, "An expert system for the selection of scheduling methods", Proceedings of the ETFA'97 Conference.
  20. R. Romanowicz, J. Jacot, A. Hertz, E. Verdebout, 1997, "A tool for an efficient selection of scheduling methods for assembly lines" Proceedings of the ICMCM&SC'97 Conference.
  21. N. Bouhmala, A. Hertz, P.A. Knutti, H.H. NSgeli, 1996, "Partitioning of unstructured meshes for parallel processing" Supercomputing Review 8, 8-10.
  22. A. Hertz, V. Robert, 1996, "How to decompose constrained course scheduling problems into easier assignment type subproblems", Proc. of the First International Conference on the Practice and Theory of Automated Timetabling, Springer LNSC volume 1153, 364-373.
  23. A. Hertz, E. Taillard, D. de Werra, 1995, "A Tutorial on Tabu Search", Proc. of Giornate di Lavoro AIRO'95, (Entreprise Systems: Management of Technological and Organizational Changes), 13-24.
  24. A. Hertz, D. de Werra, 1989, "Informatique et horaires scolaires", OUTPUT 12, 53-56.
  25. Z. Zakarya, A. Hertz, D. de Werra, 1989, "Calendriers d'arbitrages: un syst?me informatique pour des associations sportives", OUTPUT 8, 57-58.
  26. E. Amaldi, E. Mayoraz, A. Hertz, D. de Werra, 1989, "Apprentissage dans les réseaux de Hopfield", Proc. of "Journées d'Electricité", EPF-Lausanne, Switzerland (Presses Polytechniques Romandes), 77-85.


 

 

 

4. Papers submitted to refereed journals

1.          M. Uldry, M. Widmer, A. Hertz, 2010, “Two objective functions for a real life split delivery vehicle routing problem”.

2.          L. Curzi, A. Hertz, I. Lari, 2012, “A repeated sequential elimination algorithm for finding an upper bound on the clique number”.

3.          M. Aouchiche, P. Hansen, A. Hertz, C. Sellal, 2015, “Bounds on differences between some graph theoretic invariants”.

4.          H.-S. Bécotte, G. Caporossi, A. Hertz, 2015, “The Progressive visualization, a new tool for analyzing the writing process”.

5.          K. Azeuli, M. Gamache, A. Hertz, S. Paroz, 2017, Optimizing keyword positions for search engine marketing.

6.          A. Hertz, A. Hertz, H. Mélot, 2021, Using Graph Theory to Derive Inequalities for the Bell Numbers”.

7.          A. Hertz, H. Mélot, S. Bonte, G. Devillez, 2021, Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph”.

8.          A. Hertz, H. Mélot, S. Bonte, G. Devillez, P. Hauweele, 2021, Upper bounds on the average number of colors in the non-equivalent colorings of a graph”.

9.          R. Randel, D. Aloise, A. Hertz, 2021, Exploring dual information in distance metric learning for clustering.