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 à Polytechnique

Ces données sont extraites du Répertoire des publications de Polytechnique Montréal. La liste ci-dessous contient seulement les publications auxquelles a participé le professeur ou le chercheur depuis son entrée en fonction à Polytechnique. De plus, certaines publications ne sont pas dans cette liste, notamment les notes de cours et les rapports techniques internes. Vous pouvez aussi consulter le répertoire des publications scientifiques et techniques de Polytechnique Montréal.

1Desrosiers, C., Galinier, P., Hansen, P., Hertz, A. (2013). Automated Generation of Conjectures on Forbidden Subgraph Characterization. Discrete Applied Mathematics. 
2Archetti, C., Bianchessi, N., Hertz, A., Colombet, A., Gagnon, F. (2013). Directed Weighted Improper Coloring for Cellular Channel Allocation. Discrete Applied Mathematics. 
3Baptiste, P., Hertz, A., Linhares, A., Reaine, D. (2013). A Polynomial Time Algorithm for Unloading Boxes Off a Gravity Conveyor. Discrete Optimization, 10(4), p. 251-262. 
4Hertz, A., Uldry, M., Widmer, M. (2012). Integer Linear Programming Models for a Cement Delivery Problem. European Journal of Operational Research, 222(3), p. 623-631. 
5Archetti, C., Bertazzi, L., Hertz, A., Speranza, M.G. (2012). A Hybrid Heuristic for an Inventory Routing Problem. Informs Journal on Computing, 24(1), p. 101-116. 
6St-Louis, P., Gendron, B., Hertz, A. (2012). Total Domination and the Caccetta-Haggkvist Conjecture. Discrete Optimization, 9(4), p. 236-240. 
7Hertz, A., Marcotte, O., Mdimagh, A., Carreau, M., Welt, F. (2012). Optimizing the Design of a Wind Farm Collection Network. Infor, 50(2), p. 95-104. 
8Hertz, A. (2012). L'enseignement de la théorie des graphes à l'aide d'intrigues policières. Bulletin De L'APMEP, 499, p. 290-296. 
9Hertz, A. (2012). Quick on the Draw : Crime-Busting With a Mathematical Twist. Montréal: Presses Internationales Polyteochnique. 
10Hertz A. (2012). Inostrani ucesnici projekta. Grafovi, Optimizacija, Hemija, Racunarstvo : Zapisis o Radu Jednog Naucnog Projekta. Belgrade: Akademska misao. p. 72-78.
11Galinier, P., Hertz, A., Paroz, S., Pesant, G. (2011). Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints. Annals of Operations Research, 184, p. 121-135. 
12Altinakar, S., Caporossi, G., Hertz, A. (2011). On Compact K-Edge-Colorings: A Polynomial Time Reduction From Linear to Cyclic. Discrete Optimization, 8(3), p. 502-512. 
13Desrosiers, C., Galinier, P., Hertz, A., Hansen, P. (2011). Improving Constrained Pattern Mining With First-Fail-Based Heuristics. Data Mining and Knowledge Discovery, 23(1), p. 63-90. 
14Hertz, A. (2011). Der Graf der Graphen : Kriminalistische Verwicklungen mit mathematischer Pointe. Germany: Vieweg+teubner Verlag. 192 p.
15Archetti, C., Feillet, D., Hertz, A., Speranza, M.G. (2010). The Undirected Capacitated Arc Routing Problem With Profits. Computers & Operations Research, 37(11), p. 1860-1869. 
16Hertz, A., Lahrichi, N., Widmer, M. (2010). A Flexible MILP Model for Multiple-Shift Workforce Planning Under Annualized Hours. European Journal of Operational Research, 200(3), p. 860-873. 
17Desrosiers, C., Galinier, P., Hertz, A., Hansen, P. (2010). Improving Constrained Pattern Mining With First-Fail-Based Heuristics. Data Mining and Knowledge Discovery, p. 1-28. 
18Bouchard, M., Cangalovic, M., Hertz, A. (2010). On a Reduction of the Interval Coloring Problem to a Series of Bandwidth Coloring Problems. Journal of Scheduling, 13(6), p. 583-595. 
19Hertz, A., Razanakoto, R. (2010). Confection de calendriers de matchs pour le sport universitaire et collégial au Québec. Infor, 48(3), p. 181-189. 
20Hertz A., Zufferey N. (2010). Vertex Coloring Using Ant Colonies. Artificial Ants : From Collective Intelligence to Real-Life Optimization and Beyond. France: Wiley. 
21Hertz, A. (2010). L'agrapheur : intrigues policières à saveur mathématique. Montréal: Presses International Polytechnique. 
22Carreau, M., Morgenroth, M., Belashov, O., Mdimagh, A., Hertz, A., Marcotte, O. (2010). Wind Farm Design Optimization. 21st World Energy Congress.
23Desrosiers, C., Galinier, P., Hertz, A., Paroz, S. (2009). Using Heuristics to Find Minimal Unsatisfiable Subformulas in Satisfiability Problems. Journal of Combinatorial Optimization, 18(2), p. 124-150. 
24Archetti, C., Feillet, D., Hertz, A., Speranza, M.G. (2009). The Capacitated Team Orienteering and Profitable Tour Problems. Journal of the Operational Research Society, 60(6), p. 831-842. 
25Bouchard, M., Cangalovic, M., Hertz, A. (2009). About Equivalent Interval Colorings of Weighted Graphs. Discrete Applied Mathematics, 157(17), p. 3615-3624. 
26Pepin, A.-S., Desaulniers, G., Hertz, A., Huisman, D. (2009). A Comparison of Five Heuristics for the Multiple Depot Vehicle Scheduling Problem. Journal of Scheduling, 12(1), p. 17-30. 
27Hertz, A., Schindl, D., Zufferey, N. (2009). A Solution Method for a Car Fleet Management Problem With Maintenance Constraints. Journal of Heuristics, 15(5), p. 425-450. 
28Hertz, A., Plumettaz, M., Zufferey, N. (2009). Corrigendum to ''Variable Space Search for Graph Coloring'' [Discrete Appl. Math. 156 (2008) 2551-2560]. Discrete Applied Mathematics, 157(7), p. 1335-1336. 
29Hertz, A., Lahrichi, N. (2009). A Patient Assignment Algorithm for Home Care Services. Journal of the Operational Research Society, 60(4), p. 481-495. 
30Bouchard, M., Hertz, A., Desaulniers, G. (2009). Lower Bounds and a Tabu Search Algorithm for the Minimum Deficiency Problem. Journal of Combinatorial Optimization, 17(2), p. 168-191. 
31Hansen, P., Hertz, A., Kilani, R., Marcotte, O., Schindl, D. (2009). Average Distance and Maximum Induced Forest. Journal of Graph Theory, 60(1), p. 31-54. 
32Hertz, A., De Werra, A. (2009). A Magnetic Procedure for the Stability Number. Graphs and Combinatorics, 25(5), p. 707-716. 
33Hertz A., Zuffery N. (2009). La coloration des sommets d'un graphe par colonies de fourmis. Fourmis artificielles, des bases de l'optimisation aux applications indutrielles. 
34Galinier, P., Hertz, A., Paroz, S., Pesant, G. (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. 
35Hertz, A., Plumettaz, M., Zufferey, N. (2008). Variable Space Search for Graph Coloring. Discrete Applied Mathematics, 156(13), p. 2551-2560. 
36Gendron, B., Hertz, A., St-Louis, P. (2008). A Sequential Elimination Algorithm for Computing Bounds on the Clique Number of a Graph. Discrete Optimization, 5(3), p. 615-628. 
37Gendron, B., Hertz, A., St-Louis, P. (2008). On a Generalization of the Gallai-Roy-Vitaver Theorem to the Bandwidth Coloring Problem. Operations Research Letters, 36(3), p. 345-350. 
38Desrosiers, C., Galinier, P., Hertz, A. (2008). Efficient Algorithms for Finding Critical Subgraphs. Discrete Applied Mathematics, 156(2), p. 244-266. 
39Galinier, P., Hertz, A., Zufferey, N. (2008). An Adaptive Memory Algorithm for the K-Coloring Problem. Discrete Applied Mathematics, 156(2), p. 267-279. 
40Hertz, A., Varone, S. (2008). The Metric Cutpoint Partition Problem. Journal of Classification, 25(2), p. 159-175. 
41Widmer M., Hertz A., Costa D. (2008). Metaheuristics and Scheduling. Production Scheduling. Hoboken, N.J.: Wiley. p. 33-68.
42Hertz A., Mittaz M. (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.
43Hertz, A., Varone, S. (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. 
44Hertz, A., Varone, S. (2007). A Note on Tree Realizations of Matrices. Rairo-Operations Research, 41(4), p. 361-366. 
45Galinier, P., Hertz, A. (2007). Solution Techniques for the Large Set Covering Problem. Discrete Applied Mathematics, 155(3), p. 312-326. 
46Gamache, M., Hertz, A., Ouellet, J.O. (2007). A Graph Coloring Model for a Feasibility Problem in Monthly Crew Scheduling With Preferential Bidding. Computers & Operations Research, 34(8), p. 2384-2395. 
47Archetti, C., Hertz, A., Speranza, M.G. (2007). Metaheuristics for the Team Orienteering Problem. Journal of Heuristics, 13(1), p. 49-76. 
48Gendron, B., Hertz, A., St-Louis, P. (2007). On Edge Orienting Methods for Graph Coloring. Journal of Combinatorial Optimization, 13(2), p. 163-178. 
49Desrosiers, C., Galinier, P., Hansen, P., Hertz, A. (2007). Improving Frequent Subgraph Mining in the Presence of Symmetry. 5th International Workshop on Mining and Learning With Graphs.
50Lahrichi, N., Lapierre, S.D., Hertz, A., Talib, A., Bouvier, L. (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. 
51Gerber, M.U., Hertz, A., Lozin, V.V. (2006). Augmenting Chains in Graphs Without a Skew Star. Journal of Combinatorial Theory Series B, 96(3), p. 352-366. 
52Archetti, C., Speranza, M.G., Hertz, A. (2006). A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Transportation Science, 40(1), p. 64-73. 
53Galinier, P., Hertz, A. (2006). A Survey of Local Search Methods for Graph Coloring. Computers & Operations Research, 33(9), p. 2547-2562. 
54Hertz, A. (2005). Recent Trends in Arc Routing. Graph Theory, Combinatorics and Algorithms : Interdisciplinary Applications, p. 215-236. 
55Hertz A., Lozin V.V. (2005). The Maximum Independent Set Problem and Augmenting Graphs. Graph Theory and Combinatorial Optimization. p. 69-100.
56Hertz A. (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.
57Hertz, A., Schindl, D., Zufferey, N. (2005). Lower Bounding and Tabu Search Procedures for the Frequency Assignement Problem With Polarization Constraints. 4OR, 3(2), p. 69-99. 
58Cordeau J.-F., Gendreau M., Hertz A., Laporte G., Sormany J.-S. (2005). New Heuristics for the Vehicle Routing Problem. Logistics Systems : Design and Optimization. p. 279-297.
59Gerber, M.U., Hertz, A., Lozin, V.V. (2004). Stable Sets in Two Subclasses of Banner-Free Graphs. Discrete Applied Mathematics, 132(1-3), p. 121-136. 
60Gerber, M.U., Hertz, A., Schindl, D. (2004). P-5-Free Augmenting Graphs and the Maximum Stable Set Problem. Discrete Applied Mathematics, 132(1-3), p. 109-119. 
61Avanthay, C., Hertz, A., Zufferey, N. (2003). A Variable Neighborhood Search for Graph Coloring. European Journal of Operational Research, 151(2), p. 379-388. 
62Hertz, A., Lozin, V., Schindl, D. (2003). Finding Augmenting Chains in Extensions of Claw-Free Graphs. Information Processing Letters, 86(6), p. 311-316. 
63Hertz, A., Widmer, M. (2003). Guidelines for the Use of Meta-Heuristics in Combinatorial Optimization. European Journal of Operational Research, 151(2), p. 247-252. 
64Hertz, A., Widmer, M. (2003). Meta-Heuristics in Combinatorial Optimization. European Journal of Operational Research, 151.
65Kis, T., Hertz, A. (2003). A Lower Bound for the Job Insertion Problem. Discrete Applied Mathematics, 128(2-3), p. 395-419. 
66Hertz A. (2003). Application des métaheuristiques à la coloration des sommets d'un graphe. Résolution de problèmes de RO par les métaheuristiques. p. 21-48.
67Costa, M.-C., Hertz, A., Mittaz, M. (2002). Bounds and Heuristics for the Shortest Capacitated Paths Problem. Journal of Heuristics, 8, p. 449-465. 
68Galinier, P., Hertz, A., Zufferey, N. (2002). Adaptative Memory Algorithms for Graph Coloring. Computational Symposium on Graph Coloring and Generalizations (COLOR02), p. 75-82. 
69Gerber, M., Hansen, P., Hertz, A. (2002). Extension of Turan's Theorem to the 2-Stability Number. Graphs and Combinatorics, 18(3), p. 479-489. 
70Ghiani G., Hertz A., Laporte G. (2002). Recent Algorithmic Advances for Arc Routing Problems. Operations Research. Boston: Kluwer academic Publishers. p. 1-20.
71Herrmann, F., Hertz, A. (2002). Finding the Chromatic Number by Means of Critical Graphs. Journal of Experimental Algorithmics, 7(10), p. 1-9. 
72Hertz A. (2002). Operations Research in Logistics. The Essentials of Logistics and Management. Presses polytechniques et universitaires romandes. p. 253-279.
73Hertz, A. (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 p.
74Hertz A., Mittaz M. (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.
75Gerber, M.U., Hertz, A. (2001). Transformation Which Preserves the Clique Number. Journal of Combinatorial Theory. Series B, 83, p. 320-330. 
76Hertz A. (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.
77Hertz, A., Mittaz, M. (2001). Variable Neighbourhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem. Transportation Sciences, 35, p. 425-434. 
78Hertz, A., Jaumard, B., Ribeiro, C.C., Formosinho Filho, W.P. (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. 
79Hertz, A., Jaumard, B., de Aragao, M.P. (1994). Local Optima Topology for the $k$-Coloring Problem.: Viewpoints on Optimization (Grimentz, 1990; Boston, MA, 1991). Discrete Applied Mathematics. 
80Hertz, A., Jaumard, B., Ribeiro, C.C. (1994). A Graph Theory Approach to Subcontracting, Machine Duplication and Intercell Moves in Cellular Manufacturing. Discrete Applied Mathematics, 50, p. 255-265. 

 

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