Polytechnique > Recherche > Répertoire > Un professeur ou chercheur

Répertoire des expertises

Photo de Alain Hertz

Alain Hertz

Professeur titulaire
Département de mathématiques et de génie industriel

Publications

Ces données sont extraites du Répertoire des publications de Polytechnique Montréal. La liste ci-dessous recense la majorité des publications du professeur ou du chercheur, à Polytechnique, depuis 1994. Des publications datant d'avant l'embauche à Polytechnique, ou d'avant 1994, peuvent aussi être incluses dans la liste. Vous pouvez consulter le Répertoire des publications scientifiques et techniques pour plus de détails sur les documents qui y sont inclus.

1 Sivan Altinakar, Gilles Caporossi, Alain Hertz (2016). A comparison of integer and constraint programming models for the deficiency problemComputers & Operations Research, 68, p. 89-96. DOI : 10.1016/j.cor.2015.10.016 
2 Alain Hertz, Romain Montagné, François Gagnon (2016). Constructive algorithms for the partial directed weighted improper coloring problemJournal of Graph Algorithms and Applications, 20(2), p. 159-188. DOI : 10.7155/jgaa.00389 
3 Alain Hertz, Hadrien Melot (2016). Counting the number of non-equivalent vertex colorings of a graphDiscrete Applied Mathematics, 203, p. 62-71. DOI : 10.1016/j.dam.2015.09.015 
4 Alain Hertz (2016). Dessine-moi un grapheAccromath, 11(1), p. 8-13.
5 Mourchid Adegbindin, Alain Hertz, Martine Bellaïche (2016). A new efficient RLF-like algorithm for the vertex coloring problemYugoslav Journal of Operations Research, p. 3 pages. DOI : 10.2298/yjor151102003a 
6 Claudia Archetti, Nicola Bianchessi, Alain Hertz, Adrien Colombet, François Gagnon (2015). Directed weighted improper coloring for cellular channel allocationDiscrete Applied Mathematics, 182(19), p. 46-60. DOI : 10.1016/j.dam.2013.11.018 
7 D. de Werra, Alain Hertz (2015). Chromatic scheduling. Topics in chromatic graph theory. Cambridge, United Kingdom: Cambridge University Press. p. 255-276.
8 , B. Ries (2014). A note on r-equitable k-colorings of treesYugoslav Journal of Operations Research,, 24(2), p. 293-298. DOI : 10.2298/YJOR130704039H 
9 A. Hertz, O. Marcotte, D. Schindl (2014). On the maximum orders of an induced forest, an induced tree, and a stable setYugoslav Journal of Operations Research,, 24(2), p. 199-215. DOI : 10.2298/YJOR130402037H 
10 A. Hertz (2014). Grafiti - L’inspecteur Manori enquête à Paris. Éditions Amalthée. .
11 Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz (2014). Automated generation of conjectures on forbidden subgraph characterizationDiscrete Applied Mathematics, 162, p. 177-194. DOI : 10.1016/j.dam.2013.07.013 
12 Claudia Archetti, Nicola Bianchessi, M. Grazia Speranza, Alain Hertz (2014). Incomplete service and split deliveries in a routing problem with profitsNetworks, 63(2), p. 135-145. DOI : 10.1002/net.21529 
13 C. Archetti, N. Bianchessi, M. G. Speranza, A. Hertz (2014). The Split Delivery Capacitated Team Orienteering ProblemNetworks, 63(1), p. 16-33. DOI : 10.1002/net.21519 
14 Claudia Archetti, Nicola Bianchessi, Alain Hertz (2014). A branch-and-price algorithm for the robust graph coloring problemDiscrete Applied Mathematics, 165, p. 49-59. DOI : 10.1016/j.dam.2013.02.013 
15 P. Baptiste, A. Hertz, A. Linhares, D. Reaine (2013). A polynomial time algorithm for unloading boxes off a gravity conveyorDiscrete Optimization, 10(4), p. 251-262. DOI : 10.1016/j.disopt.2013.07.004 
16 Patrick St-Louis, Bernard Gendron, Alain Hertz (2012). Total domination and the Caccetta-Haggkvist conjecture. Discrete Optimization, 9(4), p. 236-240.
17 Alain Hertz, Marc Uldry, Marino Widmer (2012). Integer linear programming models for a cement delivery problem. European Journal of Operational Research, 222(3), p. 623-631.
18 A. Hertz, O. Marcotte, A. Mdimagh, M. Carreau, F. Welt (2012). Optimizing the Design of a Wind Farm Collection Network. Infor, 50(2), p. 95-104.
19 Alain Hertz (2012). Inostrani ucesnici projekta. Grafovi, optimizacija, hemija, Racunarstvo : zapisis o radu jednog naucnog projekta. Belgrade: Akademska misao. p. 72-78.
20 Alain Hertz (2012). Quick on the draw : crime-busting with a mathematical twist. Montréal: Presses Internationales Polyteochnique. .
21 Alain Hertz (2012). L'enseignement de la théorie des graphes à l'aide d'intrigues policières. Bulletin de l'APMEP, 499, p. 290-296.
22 Claudia Archetti, Luca Bertazzi, Alain Hertz, M. Grazia Speranza (2012). A Hybrid Heuristic for an Inventory Routing Problem. Informs Journal on Computing, 24(1), p. 101-116.
23 Alain Hertz (2011). Der Graf der Graphen : Kriminalistische Verwicklungen mit mathematischer Pointe. Germany: Vieweg+teubner Verlag. .
24 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, p. 121-135.
25 Sivan Altinakar, Gilles Caporossi, Alain Hertz (2011). On compact k-edge-colorings: A polynomial time reduction from linear to cyclic. Discrete Optimization, 8(3), p. 502-512.
26 A. Hertz, N. Zufferey (2010). Vertex coloring using ant colonies. Artificial ants : from collective intelligence to real-life optimization and beyond. France: Wiley. 
27 A. Hertz, R. Razanakoto (2010). Confection de calendriers de matchs pour le sport universitaire et collégial au Québec. Infor, 48(3), p. 181-189.
28 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(3), p. 860-873.
29 A. Hertz (2010). L'agrapheur : intrigues policières à saveur mathématique. Montréal: Presses International Polytechnique. .
30 Christian Desrosiers, Philippe Galinier, Alain Hertz, Pierre Hansen (2010). Improving constrained pattern mining with first-fail-based heuristicsData Mining and Knowledge Discovery, p. 1-28. DOI : 10.1007/s10618-010-0199-1 
31 M. Carreau, M. Morgenroth, O. Belashov, A. Mdimagh, A. Hertz, O. Marcotte (2010). Wind farm design optimization. 21st World Energy Congress.
32 M. Bouchard, M. Cangalovic, A. Hertz (2010). On a Reduction of the Interval Coloring Problem to a Series of Bandwidth Coloring Problems. Journal of Scheduling, 13(6), p. 583-595.
33 Claudia Archetti, Dominique Feillet, Alain Hertz, M. Grazia Speranza (2010). The undirected capacitated arc routing problem with profits. Computers & Operations Research, 37(11), p. 1860-1869.
34 A.-S. Pepin, G. Desaulniers, A. Hertz, D. Huisman (2009). A comparison of five heuristics for the multiple depot vehicle scheduling problem. Journal of Scheduling, 12(1), p. 17-30.
35 A. Hertz, N. Zuffery (2009). La coloration des sommets d'un graphe par colonies de fourmis. Fourmis artificielles, des bases de l'optimisation aux applications indutrielles. 
36 Alain Hertz, David Schindl, Nicolas Zufferey (2009). A solution method for a car fleet management problem with maintenance constraints. Journal of Heuristics, 15(5), p. 425-450.
37 A. Hertz, M. Plumettaz, N. Zufferey (2009). Corrigendum to ''variable space search for graph coloring'' [discrete appl. math. 156 (2008) 2551-2560]. Discrete Applied Mathematics, 157(7), p. 1335-1336.
38 A. Hertz, N. Lahrichi (2009). A Patient Assignment Algorithm for Home Care Services. Journal of the Operational Research Society, 60(4), p. 481-495.
39 A. Hertz, A. De Werra (2009). A magnetic procedure for the stability number. Graphs and combinatorics, 25(5), p. 707-716.
40 P. Hansen, A. Hertz, R. Kilani, O. Marcotte, D. Schindl (2009). Average distance and maximum induced forest. Journal of Graph Theory, 60(1), p. 31-54.
41 Christian Desrosiers, Philippe Galinier, Alain Hertz, Sandrine Paroz (2009). Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems. Journal of Combinatorial Optimization, 18(2), p. 124-150.
42 Mathieu Bouchard, Alain Hertz, Guy Desaulniers (2009). Lower bounds and a tabu search algorithm for the minimum deficiency problem. Journal of Combinatorial Optimization, 17(2), p. 168-191.
43 Mathieu Bouchard, Mirjana Cangalovic, Alain Hertz (2009). About equivalent interval colorings of weighted graphs. Discrete Applied Mathematics, 157(17), p. 3615-3624.
44 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(6), p. 831-842.
45 M. Widmer, A. Hertz, D. Costa (2008). Metaheuristics and scheduling. Production scheduling. Hoboken, N.J.: Wiley. p. 33-68.
46 A. Hertz, S. Varone (2008). The Metric cutpoint partition problem. Journal of classification, 25(2), p. 159-175.
47 A. Hertz, M. Plumettaz, N. Zufferey (2008). Variable Space Search for Graph Coloring. Discrete Applied Mathematics, 156(13), p. 2551-2560.
48 A. Hertz, M. Mittaz (2008). Pickup and delivery problems with services on nodes or arcs of a network. Operations research and networks. Hoboken, N.J.: Wiley. p. 165-188.
49 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(3), p. 345-350.
50 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(3), p. 615-628.
51 P. Galinier, A. Hertz, N. Zufferey (2008). An Adaptive Memory Algorithm for the K-Coloring Problem. Discrete Applied Mathematics, 156(2), p. 267-279.
52 Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant (2008). Using local search to speed up filtering algorithms for some NP-hard constraints. 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2008, v. 5015 LNCS, p. 298-302.
53 C. Desrosiers, P. Galinier, A. Hertz (2008). Efficient Algorithms for Finding Critical Subgraphs. Discrete Applied Mathematics, 156(2), p. 244-266.
54 A. Hertz, S. Varone (2007). A Note on Tree Realizations of Matrices. Rairo-Operations Research, 41(4), p. 361-366.
55 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(2), p. 235-249.
56 B. Gendron, A. Hertz, P. St-Louis (2007). On Edge Orienting Methods for Graph Coloring. Journal of Combinatorial Optimization, 13(2), p. 163-178.
57 M. Gamache, A. Hertz, J. O. Ouellet (2007). A Graph Coloring Model for a Feasibility Problem in Monthly Crew Scheduling With Preferential Bidding. Computers & Operations Research, 34(8), p. 2384-2395.
58 P. Galinier, A. Hertz (2007). Solution Techniques for the Large Set Covering Problem. Discrete Applied Mathematics, 155(3), p. 312-326.
59 C. Desrosiers, P. Galinier, P. Hansen, A. Hertz (2007). Improving frequent subgraph mining in the presence of symmetry. 5th International Workshop on Mining and Learning with Graphs.
60 C. Archetti, A. Hertz, M. G. Speranza (2007). Metaheuristics for the Team Orienteering Problem. Journal of Heuristics, 13(1), p. 49-76.
61 N. Lahrichi, S.D. Lapierre, A. Hertz, 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), p. 283-291.
62 M. U. Gerber, A. Hertz, V. V. Lozin (2006). Augmenting Chains in Graphs Without a Skew Star. Journal of Combinatorial Theory Series B, 96(3), p. 352-366.
63 P. Galinier, A. Hertz (2006). A survey of local search methods for graph coloring. Computers & Operations Research, 33(9), p. 2547-2562.
64 C. Archetti, M. G. Speranza, A. Hertz (2006). A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Transportation Science, 40(1), p. 64-73.
65 A. Hertz, D. Schindl, N. Zufferey (2005). Lower bounding and tabu search procedures for the frequency assignement problem with polarization constraints. 4OR, 3(2), p. 69-99.
66 A. Hertz, V.V. Lozin (2005). The maximum independent set problem and augmenting graphs. Graph theory and combinatorial optimization. p. 69-100.
67 A. Hertz (2005). Recent Trends in Arc Routing. Graph Theory, Combinatorics and Algorithms : Interdisciplinary Applications, p. 215-236.
68 A. Hertz (2005). Les métaheuristiques : quelques conseils pour en faire bon usage. Gestion de production et ressources humaines : méthodes de planification dans les systèmes productifs. Montréal: Presses internationales Polytechnique. p. 205-222.
69 J.-F. Cordeau, M. Gendreau, A. Hertz, G. Laporte, J.-S. Sormany (2005). New heuristics for the vehicle routing problem. Logistics systems : design and optimization. p. 279-297.
70 M. U. Gerber, A. Hertz, D. Schindl (2004). P-5-Free Augmenting Graphs and the Maximum Stable Set Problem. Discrete Applied Mathematics, 132(1-3), p. 109-119.
71 M. U. Gerber, A. Hertz, V. V. Lozin (2004). Stable Sets in Two Subclasses of Banner-Free Graphs. Discrete Applied Mathematics, 132(1-3), p. 121-136.
72 T. Kis, A. Hertz (2003). A Lower Bound for the Job Insertion Problem. Discrete Applied Mathematics, 128(2-3), p. 395-419.
73 A. Hertz, M. Widmer (2003). Meta-heuristics in combinatorial optimization. European journal of operational research, 151.
74 A. Hertz, M. Widmer (2003). Guidelines for the Use of Meta-Heuristics in Combinatorial Optimization. European Journal of Operational Research, 151(2), p. 247-252.
75 A. Hertz, V. Lozin, D. Schindl (2003). Finding Augmenting Chains in Extensions of Claw-Free Graphs. Information Processing Letters, 86(6), p. 311-316.
76 C. Avanthay, A. Hertz, N. Zufferey (2003). A Variable Neighborhood Search for Graph Coloring. European Journal of Operational Research, 151(2), p. 379-388.
77 A. Hertz, M. Mittaz (2002). Tournées de livraisons et de ramassages sur les noeuds ou les arcs d'un réseau. Recherche opérationnelle et réseaux: méthodes d'analyse spatiale. Paris: Hermes science publications. p. 167-189.
78 A. Hertz (2002). Recent trends in arc routing. (Les cahiers du GERAD (Groupe d'études et de recherche en analyse des décisions); G-2002-51). 19 pages.
79 A. Hertz (2002). Operations research in logistics. The essentials of logistics and management. Presses polytechniques et universitaires romandes. p. 253-279.
80 F. Herrmann, A. Hertz (2002). Finding the chromatic number by means of critical graphs. Journal of experimental algorithmics, 7(10), p. 1-9.
81 G. Ghiani, A. Hertz, G. Laporte (2002). Recent algorithmic advances for arc routing problems. Operations research. Boston: Kluwer academic Publishers. p. 1-20.
82 M. Gerber, P. Hansen, A. Hertz (2002). Extension of Turan's theorem to the 2-stability number. Graphs and combinatorics, 18(3), p. 479-489.
83 P. Galinier, A. Hertz, N. Zufferey (2002). Adaptative memory algorithms for graph coloring. Computational symposium on graph coloring and generalizations (COLOR02), p. 75-82.
84 M.-C. Costa, A. Hertz, M. Mittaz (2002). Bounds and heuristics for the shortest capacitated paths problem. Journal of heuristics, 8, p. 449-465.
85 A. Hertz, M. Mittaz (2001). Variable neighbourhood descent algorithm for the undirected capacitated arc routing problem. Transportation sciences, 35, p. 425-434.
86 A. Hertz (2001). Application des métaheuristiques à la coloration des sommets d'un graphe. Résolution de problèmes de RO par les métaheuristiques. Hermes Science. p. 21-48.
87 M. U. Gerber, A. Hertz (2001). Transformation which preserves the clique number. Journal of combinatorial theory. Series B, 83, p. 320-330.
88 Alain 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), p. 303-328.
89 Alain Hertz, Brigitte Jaumard, Celso C. Ribeiro (1994). A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing. Discrete Applied Mathematics, 50, p. 255-265.
90 Alain Hertz, Brigitte Jaumard, Marcus Poggi de Aragao (1994). Local optima topology for the $k$-coloring problem.: Viewpoints on optimization (Grimentz, 1990; Boston, MA, 1991). Discrete Applied Mathematics

 

© École Polytechnique de Montréal
Bottin | Plan du site | Recherche | Conditions