Répertoire des expertises

Hertz, Alain

Répertoire des expertises

Hertz, Alain

Répertoire des expertises

Publications par type

Article de revue (98) Communication de conférence (13) Livre (5) Chapitre de livre (13) Brevet Rapport (96) Thèse Ensemble de données Ressource pédagogique Image Enregistrement audio Enregistrement vidéo Autre

Alain Hertz (225)

Articles de revue (98)
- 2024
  - Hertz, A., Bonte, S., Devillez, G., Dusollier, V., Mélot, H., & Schindl, D. (2024). Extremal Chemical Graphs for the Arithmetic-Geometric Index. match Communications in Mathematical and in Computer Chemistry, 93(3), 791-818.
  - Hertz, A. (2024). Graphs obtained by disjoint unions and joins of cliques and stable sets. RAIRO - Operations Research, 58(3), 2631-2636.
  - Hertz, A., Bonte, S., Devillez, G., & Mélot, H. (2024). The average size of maximal matchings in graphs. Journal of Combinatorial Optimization, 47(3), 46 (34 pages).
- 2023
  - Liu, D., Perreault, V., Hertz, A., & Lodi, A. (2023). A machine learning framework for neighbor generation in metaheuristic search. Frontiers in Applied Mathematics and Statistics, 9, 15 pages.
  - Hertz, A., Mélot, H., Bonte, S., & Devillez, G. (2023). Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph. Discrete Applied Mathematics, 335, 69-81.
  - Hertz, A., Mélot, H., Bonte, S., Devillez, G., & Hauweele, P. (2023). Upper bounds on the average number of colors in the non-equivalent colorings of a graph. Graphs and Combinatorics, 39(3), 49 (22 pages).
- 2022
  - Hertz, A. (2022). Decycling Bipartite Graphs. Journal of Graph Algorithms and Applications, 25(1), 461-480.
- 2021
  - Randel, R., Aloise, D., Blanchard, S. J., & Hertz, A. (2021). A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering. Data Mining and Knowledge Discovery, 35(6), 2341-2368.
  - Contardo, C., & Hertz, A. (2021). An exact algorithm for a class of geometric set-cover problems. Discrete Applied Mathematics, 300, 25-35.
  - Hertz, A., Kuflik, T., & Tuval, N. (2021). Resolving sets and integer programs for recommender systems. Journal of Global Optimization, 81(1), 153-178.
  - Hertz, A., Hertz, A., & Mélot, H. (2021). Using Graph Theory to Derive Inequalities for the Bell Numbers. Journal of Integer Sequences, 24(10), 21.10.6 (19 pages).
- 2020
  - Bürgy, R., Hertz, A., & Baptiste, P. (2020). An exact dynamic programming algorithm for the precedence-constrained class sequencing problem. Computers & Operations Research, 124, 24 pages.
  - Hertz, A. (2020). An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes. Optimization Letters, 14(2), 355-367.
  - Hertz, A., & Ridremont, T. (2020). A tabu search for the design of capacitated rooted survivable planar networks. Journal of Heuristics, 26(6), 829-850.
  - Bentz, C., Costa, M.-C., & Hertz, A. (2020). On the edge capacitated Steiner tree problem. Discrete Optimization, 38, 25 pages.
- 2019
  - Hertz, A., Montagné, R., & Gagnon, F. (2019). A comparison of integer programming models for the partial directed weighted improper coloring problem. Discrete Applied Mathematics, 261, 229-245.
  - Hauweele, P., Hertz, A., Melot, H., Ries, B., & Devillez, G. (2019). Maximum eccentric connectivity index for graphs with given diameter. Discrete Applied Mathematics, 268, 102-111.
  - Devillez, G., Hertz, A., Mélot, H., & Hauweele, P. (2019). Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices. Yugoslav Journal of Operations Research, 29(2), 193-202.
  - Hertz, A., & Picouleau, C. (2019). On graceful difference labelings of disjoint unions of circuits. Open Journal of Discrete Applied Mathematics, 2(3), 38-55.
- 2018
  - Bürgy, R., Baptiste, P., Hertz, A., Rebaine, D., & Linhares, A. (2018). A stochastic online algorithm for unloading boxes from a conveyor line. Flexible Services and Manufacturing Journal, 30(4), 764-784.
  - Hertz, A., Lozin, V., Ries, B., Zamaraev, V., & de Werra, D. (2018). Dominating induced matchings in graphs containing no long claw. Journal of Graph Theory, 88(1), 18-39.
  - Hansen, P., Aouchiche, M., Caporossi, G., Hertz, A., & Sellal, C. (2018). Mixed integer programming and extremal chemical graphs. International Journal of Chemistry and Chemical Engineering Systems, 3, 22-30.
- 2017
  - Montagné, R., Hertz, A., & Gagnon, F. (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.
  - Hansen, P., Hertz, A., Sellal, C., Vukičević, D., Aouchiche, M., & Caporossi, G. (2017). Edge realizability of connected simple graphs. Match-Communications in Mathematical and in Computer Chemistry, 78(3), 689-712.
  - Hertz, A., Montagné, R., & Gagnon, F. (2017). Online algorithms for the maximum k-colorable subgraph problem. Computers & Operations Research, 91, 209-224.
  - Baptiste, P., Bürgy, R., Hertz, A., & Rebaïne, D. (2017). Online heuristics for unloading boxes off a gravity conveyor. International Journal of Production Research, 55(11), 3046-3057.
  - Altinakar, S., Caporossi, G., & Hertz, A. (2017). Symmetry breaking constraints for the minimum deficiency problem. Journal of Graph Algorithms and Applications, 21(2), 195-218.
  - Rybarczyk, A., Hertz, A., Kasprzak, M., & Blazewicz, J. (2017). Tabu search for the RNA partial degradation problem. International Journal of Applied Mathematics and Computer Science, 27(2), 401-415.
- 2016
  - Altinakar, S., Caporossi, G., & Hertz, A. (2016). A comparison of integer and constraint programming models for the deficiency problem. Computers & Operations Research, 68, 89-96.
  - Neveu, F., Bécotte-Boutin, H.-S., Caporossi, G., Hertz, A., Leblay, C., Bergounioux, G., Côté, M. H., Fournier, J. M., Hriba, L., & Prévost, S. (2016). Analyse automatique des données scripturales prétraitées par des outils de visualization. SHS Web of Conferences, 27, 06001 (18 pages).
  - Adegbindin, M., Hertz, A., & Bellaïche, M. (2016). A new efficient RLF-like algorithm for the vertex coloring problem. Yugoslav Journal of Operations Research, 26(4), 441-456.
  - Absil, R., Camby, E., Hertz, A., & Mélot, H. (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, 234, 3-11.
  - Hertz, A., Montagné, R., & Gagnon, F. (2016). Constructive algorithms for the partial directed weighted improper coloring problem. Journal of Graph Algorithms and Applications, 20(2), 159-188.
  - Hertz, A., & Mélot, H. (2016). Counting the number of non-equivalent vertex colorings of a graph. Discrete Applied Mathematics, 203, 62-71.
  - Hertz, A., Marcotte, O., Mdimagh, A., Carreau, M., & Welt, F. (2016). Design of a wind farm collection network when several cable types are available. Journal of the Operational Research Society, 68(1), 62-73.
  - Hertz, A. (2016). Dessine-moi un graphe. Accromath, 11(1), 8-13.
- 2014
  - Archetti, C., Bianchessi, N., & Hertz, A. (2014). A branch-and-price algorithm for the robust graph coloring problem. Discrete Applied Mathematics, 165, 49-59.
  - Hertz, A., & Ries, B. (2014). A note on r-equitable k-colorings of trees. Yugoslav Journal of Operations Research, 24(2), 293-298.
  - Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (2014). Automated generation of conjectures on forbidden subgraph characterization. Discrete Applied Mathematics, 162, 177-194.
  - Archetti, C., Bianchessi, N., Speranza, M. G., & Hertz, A. (2014). Incomplete service and split deliveries in a routing problem with profits. Networks, 63(2), 135-145.
  - Hertz, A., Marcotte, O., & Schindl, D. (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.
  - Archetti, C., Bianchessi, N., Speranza, M. G., & Hertz, A. (2014). The Split Delivery Capacitated Team Orienteering Problem. Networks, 63(1), 16-33.
- 2013
  - Baptiste, P., Hertz, A., Linhares, A., & Reaine, D. (2013). A polynomial time algorithm for unloading boxes off a gravity conveyor. Discrete Optimization, 10(4), 251-262.
- 2012
  - Archetti, C., Bertazzi, L., Hertz, A., & Speranza, M. G. (2012). A Hybrid Heuristic for an Inventory Routing Problem. INFORMS Journal on Computing, 24(1), 101-116.
  - Hertz, A., Uldry, M., & Widmer, M. (2012). Integer linear programming models for a cement delivery problem. European Journal of Operational Research, 222(3), 623-631.
  - Hertz, A. (2012). L'enseignement de la théorie des graphes à l'aide d'intrigues policières. Bulletin de l'APMEP, 499, 290-296.
  - Hertz, A., Marcotte, O., Mdimagh, A., Carreau, M., & Welt, F. (2012). Optimizing the Design of a Wind Farm Collection Network. INFOR, 50(2), 95-104.
  - St-Louis, P., Gendron, B., & Hertz, A. (2012). Total domination and the Caccetta–Häggkvist conjecture. Discrete Optimization, 9(4), 236-240.
- 2011
  - Altinakar, S., Caporossi, G., & Hertz, A. (2011). On compact k-edge-colorings: A polynomial time reduction from linear to cyclic. Discrete Optimization, 8(3), 502-512.
  - Galinier, 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(1), 121-135.
- 2010
  - Hertz, 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), 860-873.
  - Hertz, A., & Razanakoto, R. (2010). Confection de calendriers de matchs pour le sport universitaire et collégial au Québec. INFOR, 48(3), 181-189.
  - Desrosiers, C., Galinier, P., Hertz, A., & Hansen, P. (2010). Improving constrained pattern mining with first-fail-based heuristics. Data Mining and Knowledge Discovery, 23(1), 1-28.
  - Bouchard, M., Čangalović, M., & Hertz, A. (2010). On a Reduction of the Interval Coloring Problem to a Series of Bandwidth Coloring Problems. Journal of Scheduling, 13(6), 583-595.
  - Archetti, C., Feillet, D., Hertz, A., & Speranza, M. G. (2010). The undirected capacitated arc routing problem with profits. Computers & Operations Research, 37(11), 1860-1869.
- 2009
  - Bouchard, M., Čangalović, M., & Hertz, A. (2009). About equivalent interval colorings of weighted graphs. Discrete Applied Mathematics, 157(17), 3615-3624.
  - Pepin, 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), 17-30.
  - Hertz, A., & De Werra, A. (2009). A magnetic procedure for the stability number. Graphs and Combinatorics, 25(5), 707-716.
  - Hertz, A., & Lahrichi, N. (2009). A Patient Assignment Algorithm for Home Care Services. Journal of the Operational Research Society, 60(4), 481-495.
  - Hertz, A., Schindl, D., & Zufferey, N. (2009). A solution method for a car fleet management problem with maintenance constraints. Journal of Heuristics, 15(5), 425-450.
  - Hansen, P., Hertz, A., Kilani, R., Marcotte, O., & Schindl, D. (2009). Average distance and maximum induced forest. Journal of Graph Theory, 60(1), 31-54.
  - Hertz, 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), 1335-1336.
  - Bouchard, M., Hertz, A., & Desaulniers, G. (2009). Lower bounds and a tabu search algorithm for the minimum deficiency problem. Journal of Combinatorial Optimization, 17(2), 168-191.
  - Archetti, 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), 831-842.
  - Desrosiers, C., Galinier, P., Hertz, A., & Paroz, S. (2009). Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems. Journal of Combinatorial Optimization, 18(2), 124-150.
- 2008
  - Galinier, P., Hertz, A., & Zufferey, N. (2008). An Adaptive Memory Algorithm for the K-Coloring Problem. Discrete Applied Mathematics, 156(2), 267-279.
  - Gendron, 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), 615-628.
  - Desrosiers, C., Galinier, P., & Hertz, A. (2008). Efficient Algorithms for Finding Critical Subgraphs. Discrete Applied Mathematics, 156(2), 244-266.
  - Gendron, 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), 345-350.
  - Hertz, A., & Varone, S. (2008). The Metric cutpoint partition problem. Journal of Classification, 25(2), 159-175.
  - Hertz, A., Plumettaz, M., & Zufferey, N. (2008). Variable Space Search for Graph Coloring. Discrete Applied Mathematics, 156(13), 2551-2560.
- 2007
  - Gamache, 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), 2384-2395.
  - Hertz, A., & Varone, S. C. (2007). A Note on Tree Realizations of Matrices. RAIRO: Operations Research, 41(4), 361-366.
  - Archetti, C., Hertz, A., & Speranza, M. G. (2007). Metaheuristics for the Team Orienteering Problem. Journal of Heuristics, 13(1), 49-76.
  - Gendron, B., Hertz, A., & St-Louis, P. (2007). On Edge Orienting Methods for Graph Coloring. Journal of Combinatorial Optimization, 13(2), 163-178.
  - Galinier, P., & Hertz, A. (2007). Solution Techniques for the Large Set Covering Problem. Discrete Applied Mathematics, 155(3), 312-326.
  - Hertz, 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), 235-249.
- 2006
  - Lahrichi, 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), 283-291.
  - Galinier, P., & Hertz, A. (2006). A survey of local search methods for graph coloring. Computers & Operations Research, 33(9), 2547-2562.
  - Archetti, C., Speranza, M. G., & Hertz, A. (2006). A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Transportation Science, 40(1), 64-73.
  - Gerber, M. U., Hertz, A., & Lozin, V. V. (2006). Augmenting Chains in Graphs Without a Skew Star. Journal of Combinatorial Theory: Series B, 96(3), 352-366.
- 2005
  - Hertz, A., Schindl, D., & Zufferey, N. (2005). Lower bounding and tabu search procedures for the frequency assignement problem with polarization constraints. 4OR, 3(2), 69-99.
- 2004
  - Gerber, M. U., Hertz, A., & Schindl, D. (2004). P-5-Free Augmenting Graphs and the Maximum Stable Set Problem. Discrete Applied Mathematics, 132(1-3), 109-119.
  - Gerber, M. U., Hertz, A., & Lozin, V. V. (2004). Stable Sets in Two Subclasses of Banner-Free Graphs. Discrete Applied Mathematics, 132(1-3), 121-136.
- 2003
  - Kis, T., & Hertz, A. (2003). A Lower Bound for the Job Insertion Problem. Discrete Applied Mathematics, 128(2-3), 395-419.
  - Avanthay, C., Hertz, A., & Zufferey, N. (2003). A Variable Neighborhood Search for Graph Coloring. European Journal of Operational Research, 151(2), 379-388.
  - Hertz, A., Lozin, V., & Schindl, D. (2003). Finding Augmenting Chains in Extensions of Claw-Free Graphs. Information Processing Letters, 86(6), 311-316.
  - Hertz, A., & Widmer, M. (2003). Guidelines for the use of meta-heuristics in combinatorial optimization. European Journal of Operational Research, 151(2), 247-252.
- 2002
  - Costa, M.-C., Hertz, A., & Mittaz, M. (2002). Bounds and heuristics for the shortest capacitated paths problem. Journal of Heuristics, 8(4), 449-465.
  - Gerber, M., Hansen, P., & Hertz, A. (2002). Extension of Turan's theorem to the 2-stability number. Graphs and Combinatorics, 18(3), 479-489.
  - Herrmann, F., & Hertz, A. (2002). Finding the chromatic number by means of critical graphs. Journal of Experimental Algorithmics, 7(10), 1-9.
- 2001
  - Gerber, M. U., & Hertz, A. (2001). Transformation which preserves the clique number. Journal of Combinatorial Theory: Series B, 83(2), 320-330.
  - Hertz, A., & Mittaz, M. (2001). Variable neighbourhood descent algorithm for the undirected capacitated arc routing problem. Transportation Science, 35(4), 425-434.
- 2000
  - Herrmann, F., & Hertz, A. (2000). Finding the chromatic number by means of critical graphs. Electronic Notes in Discrete Mathematics, 5, 174-176.
- 1997
  - Hansen, P., Hertz, A., & Quinodoz, N. (1997). Splitting trees. Discrete Mathematics, 165-166, 403-419.
- 1994
  - Hertz, 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(3), 255-265.
  - Hertz, 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), 303-328.
- 1993
  - Hansen, P., Hertz, A., & Kuplinsky, J. (1993). Bounded vertex colorings of graphs. Discrete Mathematics, 111(1-3), 305-312.
Communications de conférence (13)
- 2024
  - Wecker, A. J., Tuval, N., Hertz, A., Mahamid, M., & Kuflik, T. (octobre 2024). A roadmap for privacy preserving tourist recommendation system [Communication écrite]. Workshop on Recommenders in Tourism (RecTour 2024), Bari, Italy.
- 2023
  - Randel, R., Aloise, D., & Hertz, A. (avril 2023). A Lagrangian-based approach to learn distance metrics for clustering with minimal data transformation [Communication écrite]. SIAM International Conference on Data Mining (SDM 2023), Minneapolis, MN, USA.
- 2012
  - Archetti, C., Bianchessi, N., Hertz, A., Colombet, A., & Gagnon, F. (août 2012). Directed weighted improper coloring for cellular channel allocation [Communication écrite]. 8th International Colloquium on Graphs and Optimization (GO VIII), Leukerbad, Switzerland. Publié dans Discrete Applied Mathematics, 182(19).
- 2010
  - Carreau, M., Morgenroth, M., Belashov, O., Mdimagh, A., Hertz, A., & Marcotte, O. (septembre 2010). Wind farm design optimization [Communication écrite]. 21st World Energy Congress, Montréal, Québec.
- 2009
  - Altinakar, S., Caporossi, G., & Hertz, A. (2009). On compact edge-colorings : a polynomial time reduction from k-linear to k-cyclic [Résumé]. Combinatorics Seminar (1 page).
- 2008
  - Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (mai 2008). Using local search to speed up filtering algorithms for some NP-hard constraints [Communication écrite]. 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), Paris, France.
- 2007
  - Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (août 2007). Improving frequent subgraph mining in the presence of symmetry [Communication écrite]. 5th International Workshop on Mining and Learning with Graphs, Firenze, Italia.
- 2005
  - Hertz, A. Recent Trends in Arc Routing [Communication écrite]. Haifa Workshops on Interdisciplinary Applications of Graph Theory, Combinatorics and Algorithms, Haifa, Israel.
- 2002
  - Galinier, P., Hertz, A., & Zufferey, N. (janvier 2002). Adaptative memory algorithms for graph coloring [Communication écrite]. Computational Symposium on Graph Coloring and Generalizations (COLOR 2002), Ithaca,US.
- 1994
  - Gendreau, M., Hertz, A., & Laporte, G. (juin 1994). A tabu search heuristic for the vehicle routing problem with backhauls [Communication écrite]. 2nd Triennal Symposium on Transportation Analysis (Tristan II), Capri, Italy.
  - Gendreau, M., Hertz, A., Laporte, G., & Mihnea, S. (juin 1994). Efficient heuristics for traveling salesman and vehicle problems with time windows [Communication écrite]. 2nd Triennal Symposium on Transportation Analysis (Tristan II), Capri, Italy.
  - Hertz, A., Jaumard, B., & Poggi De Aragão, M. Local optima topology for the k-coloring problem [Communication écrite]. Viewpoints on Optimization; and Graph Labelling, Grimentz, Switzerland; Boston, Mass. Publié dans Discrete Applied Mathematics, 49(1-3).
- 1991
  - Gendreau, M., Hertz, A., & Laporte, G. (juin 1991). A Tabu Search Heuristic for the Vehicle Routing Problem [Communication écrite]. 1st Triennal Symposium on Transportation Analysis (Tristan I), Montréal, Québec.
Livres (5)
- 2014
  - Hertz, A. (2014). Graphiti - L'inspecteur Manori enquête à Paris.
- 2012
  - Hertz, A. (2012). Quick on the draw : crime-busting with a mathematical twist.
- 2011
  - Hertz, A. (2011). Der Graf der Graphen : Kriminalistische Verwicklungen mit mathematischer Pointe.
- 2010
  - Hertz, A. (2010). L'agrapheur : intrigues policières à saveur mathématique.
- 2005
  - Avis, D., Hertz, A., & Marcotte, O. (édit.) (2005). Graph Theory and Combinatorial Optimization.
Chapitres de livre (13)
- 2021
  - Hertz, A., & Ries, B. (2021). Graph colouring variations. Dans Beineke, L. W., Golumbic, M. C., & Wilson, R. J. (édit.), Topics in Algorithmic Graph Theory (p. 33-51).
- 2019
  - Bécotte-Boutin, H.-S., Caporossi, G., Hertz, A., & Leblay, C. (2019). Writing and rewriting: the colored numerical visualization of Keystroke logging. Dans Lingdgren, E., & Sullivan, K. P. H. (édit.), Observing writing: insights from Keystroke logging and handwriting (p. 96-114).
- 2015
  - de Werra, D., & Hertz, A. (2015). Chromatic scheduling. Dans Beineke, L. W., & Wilson, R. J. (édit.), Topics in chromatic graph theory (p. 255-276).
- 2010
  - Hertz, A., & Zufferey, N. (2010). Vertex coloring using ant colonies. Dans Artificial ants : from collective intelligence to real-life optimization and beyond (p. 219-236).
- 2009
  - Hertz, A., & Zuffery, N. (2009). La coloration des sommets d'un graphe par colonies de fourmis. Dans Fourmis artificielles, des bases de l'optimisation aux applications industrielles .
- 2008
  - Widmer, M., Hertz, A., & Costa, D. (2008). Metaheuristics and Scheduling. Dans Production Scheduling (p. 33-68).
  - Hertz, A., & Mittaz, M. (2008). Pickup and delivery problems with services on nodes or arcs of a network. Dans Operations research and networks (p. 165-188).
- 2005
  - Hertz, A. (2005). Les métaheuristiques : quelques conseils pour en faire bon usage. Dans Baptiste, P., Giard, V., Haït, A., & Soumis, F. (édit.), Gestion de production et ressources humaines : méthodes de planification dans les systèmes productifs (p. 205-222).
  - Cordeau, J.-F., Gendreau, M., Hertz, A., Laporte, G., & Sormany, J.-S. (2005). New heuristics for the vehicle routing problem. Dans Langevin, A., & Riopel, D. (édit.), Logistics systems : design and optimization (p. 279-297).
- 2002
  - Hertz, A. (2002). Operations research in logistics. Dans The essentials of logistics and management (p. 253-279).
  - Ghiani, G., Hertz, A., & Laporte, G. (2002). Recent algorithmic advances for arc routing problems. Dans Kozan, E., & Ohuchi, A. (édit.), Operations research/management science at work (Vol. 43, p. 1-20).
  - Hertz, A., & Mittaz, M. (2002). Tournées de livraisons et de ramassages sur les noeuds ou les arcs d'un réseau. Dans Recherche opérationnelle et réseaux: méthodes d'analyse spatiale (p. 167-189).
- 2001
  - Hertz, A. (2001). Application des métaheuristiques à la coloration des sommets d'un graphe. Dans Pirlot, M., & Teghem, J. (édit.), Résolution de problèmes de RO par les métaheuristiques (p. 21-48).
Rapports (96)
- 2025
  - Bonte, S., Devillez, G., Dusollier, V., Hertz, A., & Mélot, H. (2025). Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices. (Rapport technique n° G-2025-05).
- 2024
  - Hertz, A., Bonte, S., Devillez, G., Dusollier, V., Mélot, H., & Schindl, D. (2024). Extremal chemical graphs for the arithmetic-geometric index. (Rapport technique n° G-2024-27).
- 2023
  - Tuval, N., Hertz, A., & Kuflik, T. (2023). Estimating serendipity in content-based recommender systems. (Rapport technique n° G-2023-35).
  - Hertz, A. (2023). Graphs obtained by disjoint unions and joins of cliques and stable sets. (Rapport technique n° G-2023-59).
  - Perreault, V., Hertz, A., & Lodi, A. (2023). Tactical wireless network design with multi-beam antennas. (Rapport technique n° G-2023-34).
- 2022
  - Tuval, N., Hertz, A., & Kuflik, T. (2022). Addressing the cold start problem in privacy preserving content-based recommender systems using hypercube graphs. (Rapport technique n° G-2022-55).
  - Marcotte, O., Quesnel, F., Carreau, J., Schulz, J., Blondin Massé, A., Lindstrom, M. R., Meurs, M.-J., Hertz, A., Aflaki, G., Plante, J.-F., Tafolong, E., & Gervais-Dubé, M. (2022). Comptes rendus du douzième atelier de résolution de problèmes industriels de Montréal, 22-26 août 2022 / Proceedings of the twelfth Montréal industrial problem solving workshop, August 22-26, 2022. (Rapport technique n° G-2022-63).
  - Hertz, A., Bonte, S., Devillez, G., & Mélot, H. (2022). The average size of maximal matchings in graphs. (Rapport technique n° G-2022-13).
- 2021
  - Randel, R., Aloise, D., & Hertz, A. (2021). Exploring dual information in distance metric learning for clustering. (Rapport technique n° G-2021-32).
  - Hertz, A., Mélot, H., Bonte, S., & Devillez, G. (2021). Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph. (Rapport technique n° G-2021-25).
  - Hertz, A., Mélot, H., Bonte, S., Devillez, G., & Hauweele, P. (2021). Upper bounds on the average number of colors in the non-equivalent colorings of a graph. (Rapport technique n° G-2021-28).
  - Hertz, A., Hertz, A., & Mélot, H. (2021). Using graph theory to derive inequalities for the Bell numbers. (Rapport technique n° G-2021-06).
- 2020
  - Contardo, C., & Hertz, A. (2020). An exact algorithm for a class of geometric set-cover problems. (Rapport technique n° G-2020-17).
  - Hertz, A. (2020). Decycling bipartite graphs. (Rapport technique n° G-2020-43).
- 2019
  - Randel, R., Aloise, D., Blanchard, S., & Hertz, A. (2019). A Lagrangian-based score for assessing the quality of pairwise constraints in SSC. (Rapport technique n° G-2019-96).
  - Bürgy, R., Baptiste, P., & Hertz, A. (2019). An exact dynamic programming algorithm for the precedence-constrained class sequencing problem. (Rapport technique n° G-2017-82).
  - Hertz, A., & Ries, B. (2019). Graph colouring variations. (Rapport technique n° G-2019-32).
  - Hertz, A. (2019). Resolving sets and integer programs for recommender systems. (Rapport technique n° G-2019-12).
- 2018
  - Hertz, A., & Ridremont, T. (2018). A tabu search for the design of capacitated rooted survivable planar networks. (Rapport technique n° G-2018-64).
  - Hauweele, P., Hertz, A., Mélot, H., Ries, B., & Devillez, G. (2018). Maximum eccentric connectivity index for graphs with given diameter. (Rapport technique n° G-2018-66).
  - Devillez, G., Hertz, A., Mélot, H., & Hauweele, P. (2018). Minimum eccentric connectivity index for graphs with fixed order and fixed number of pending vertices. (Rapport technique n° G-2018-69).
  - Hertz, A., & Picouleau, C. (2018). On graceful difference labelings of disjoint unions of circuits. (Rapport technique n° G-2018-65).
- 2017
  - Hertz, A. (2017). An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes. (Rapport technique n° G-2017-17).
  - Hansen, P., Hertz, A., Sellal, C., Vukičević, D., Aouchiche, M., & Caporossi, G. (2017). Edge realizability of connected simple graphs. (Rapport technique n° G-2017-10).
  - Azeuli Nkamegni, K., Gamache, M., Hertz, A., & Paroz, S. (2017). Optimizing keyword positions for search engine marketing. (Rapport technique n° G-2017-26).
- 2016
  - Hertz, A., Montagné, R., & Gagnon, F. (2016). Integer programming models for the partial directed weighted improper coloring problem. (Rapport technique n° G-2016-112).
  - Hertz, A., Montagné, R., & Gagnon, F. (2016). Online algorithms for the maximum k-colorable subgraph problem. (Rapport technique n° G-2016-111).
  - Baptiste, P., Bürgy, R., Hertz, A., & Rebaïne, D. (2016). Online heuristics for unloading boxes off a gravity conveyor. (Rapport technique n° G-2016-20).
  - Hertz, A., Marcotte, O., Mdimagh, A., Carreau, M., & Welt, F. (2016). On the design of a wind farm collection network when several cable types are available. (Rapport technique n° G-2015-23).
  - Bentz, C., Costa, M.-C., & Hertz, A. (2016). On the edge capacitated Steiner tree problem. (Rapport technique n° G-2016-27).
  - Altinakar, S., Caporossi, G., & Hertz, A. (2016). Symmetry breaking constraints for the minimum deficiency problem. (Rapport technique n° G-2016-11).
  - Rybarczyk, A., Hertz, A., Kasprzak, M., & Blazewicz, J. (2016). Tabu search for the RNA partial degradation problem. (Rapport technique n° G-2016-07).
- 2015
  - Absil, R., Camby, E., Hertz, A., & Mélot, H. (2015). A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n-3. (Rapport technique n° G-2015-04).
  - Aouchiche, M., Hansen, P., Hertz, A., & Sellal, C. (2015). Bounds on differences between some graph theoretic invariants. (Rapport technique n° G-2015-31).
  - Hertz, A., Montagné, R., & Gagnon, F. (2015). Constructive algorithms for the partial directed weighted improper coloring problem. (Rapport technique n° G-2015-61).
  - Hertz, A., Lozin, V., Ries, B., Zamaraev, V., & De Werra, D. (2015). Dominating induced matchings in graphs containing no long claw. (Rapport technique n° G-2015-49).
  - Bécotte-Boutin, H.-S., Caporossi, G., & Hertz, A. (2015). The progressive visualization, a new tool for analyzing the writing process. (Rapport technique n° G-2015-141).
- 2014
  - Altinakar, S., Caporossi, G., & Hertz, A. (2014). A comparison of integer and constraint programming models for the deficiency problem. (Rapport technique n° G-2014-25).
  - Adegbindin, M., Hertz, A., & Bellaïche, M. (2014). A new efficient RLF-like algorithm for the vertex coloring problem. (Rapport technique n° G-2014-24).
  - Montagné, R., Hertz, A., & Gagnon, F. (2014). Graph coloring to maximize the number of communicating mobiles in wireless networks. (Rapport technique n° G-2014-79).
- 2013
  - Hertz, A., & Ries, B. (2013). A Note on r-Equitable k-Colorings of Trees. (Rapport technique n° G-2013-83).
  - De Werra, D., & Hertz, A. (2013). Chromatic Scheduling. (Rapport technique n° G-2013-84).
  - Hertz, A., & Mélot, H. (2013). Counting the Number of Non-Equivalent Vertex Colorings of a Graph. (Rapport technique n° G-2013-82).
- 2012
  - Archetti, C., Bianchessi, N., & Hertz, A. (2012). A Branch-and-Price Algorithm for the Robust Graph Coloring Problem. (Rapport technique n° G-2011-75).
  - Baptiste, P., Hertz, A., Linhares, A., & Rebaïne, D. (2012). A polynomial time algorithm for unloading boxes off a gravity conveyor. (Rapport technique n° G-2012-78).
  - Curzi, L., Hertz, A., & Lari, I. (2012). A Repeated Sequential Elimination Algorithm for Finding an Upper Bound on the Clique Number. (Rapport technique n° G-2012-80).
  - Archetti, C., Bianchessi, N., Hertz, A., Colombet, A., & Gagnon, F. (2012). Directed Weighted Improper Coloring for Cellular Channel Allocation. (Rapport technique n° G-2012-85).
  - Hertz, A., Marcotte, O., Mdimagh, A., Carreau, M., & Welt, F. (2012). Optimizing the Design of a Wind Farm Collection Network. (Rapport technique n° G-2011-79).
- 2011
  - Archetti, C., Bianchessi, N., Hertz, A., & Speranza, M. G. (2011). Incomplete Service and Split Deliveries in a Routing Problem with Profits. (Rapport technique n° G-2011-02).
  - Hertz, A., Uldry, M., & Widmer, M. (2011). Integer Linear Programming Models for a Cement Delivery Problem. (Rapport technique n° G-2011-20).
  - Hertz, A., & Ries, B. (2011). On r-Equitable Colorings of Trees and Forests. (Rapport technique n° G-2011-40).
  - Marcotte, O., Hertz, A., & Schindl, D. (2011). On the Maximum Orders of an Induced Forest, an Induced Tree, and a Stable Set. (Rapport technique n° G-2011-45).
- 2010
  - Hertz, A., & Razanakoto, R. (2010). Confection de calendriers de matchs pour le sport universitaire et collégial au Québec. (Rapport technique n° G-2010-04).
  - Archetti, C., Bianchessi, N., Hertz, A., & Speranza, M. G. (2010). The Split Delivery Capacitated Team Orienteering Problem. (Rapport technique n° G-2010-55).
- 2009
  - Archetti, C., Bertazzi, L., & Hertz, A. (2009). A Hybrid Heuristic for an Inventory-Touring Problem. (Rapport technique n° G-2009-04).
  - Altinakar, S., Caporossi, G., & Hertz, A. (2009). On Compact k-Edge-Colorings: A Polynomial Time Reduction From Linear to Cyclic. (Rapport technique n° G-2009-53).
  - Archetti, C., Feillet, D., Hertz, A., & Speranza, M. G. (2009). The Capacitated Arc Routing Problem with Profits. (Rapport technique n° G-2009-01).
  - St-Louis, P., Gendron, B., & Hertz, A. (2009). Total Domination and the Caccetta-Häggkvist Conjecture. (Rapport technique n° G-2009-78).
- 2008
  - Bouchard, M., Čangalović, M., & Hertz, A. (2008). About Equivalent Interval Colorings of Weighted Graphs. (Rapport technique n° G-2008-03).
  - Hertz, A., Lahrichi, N., & Widmer, M. (2008). A Flexible MILP Model for Multiple-Shift Workforce Planning Under Annualized Hours. (Rapport technique n° G-2008-05).
  - Hertz, A., & Zufferey, N. (2008). La coloration des sommets d'un graphe par colonies de fourmis. (Rapport technique n° G-2008-29).
  - Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (2008). SyGMA: Reducing Symmetry in Graph Mining. (Rapport technique n° G-2007-12).
  - Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (2008). Using Heuristics to Speed Up Frequent Pattern Mining. (Rapport technique n° G-2008-13).
  - Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (2008). Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints. (Rapport technique n° G-2008-02).
- 2007
  - Gendron, B., Hertz, A., & St-Louis, P. (2007). A Decomposition Algorithm for Computing Bounds on the Clique Number of a Graph. (Rapport technique n° G-2007-01).
  - Hertz, A., & Lahrichi, N. (2007). A Patient Assignment Algorithm for Home Care Services. (Rapport technique n° G-2006-80).
  - Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (2007). Automated Generation of Conjectures on Forbidden Subgraph Characterization. (Rapport technique n° G-2007-48).
  - Bouchard, M., Hertz, A., & Desaulniers, G. (2007). Lower Bounds and a Tabu Search Algorithm for the Minimum Deficiency Problem. (Rapport technique n° G-2007-14).
  - Gendron, B., Hertz, A., & St-Louis, P. (2007). On a Generalization of the Gallai-Roy-Vitaver Theorem and Mathematical Programming Models for the Bandwidth Coloring Problem. (Rapport technique n° G-2007-22).
  - Bouchard, M., Čangalović, M., & Hertz, A. (2007). On a Reduction of the Interval Coloring Problem to a Series of Bandwidth Coloring Problems. (Rapport technique n° G-2007-69).
  - Archetti, C., Feillet, D., Hertz, A., & Speranza, M. G. (2007). The Capacitated Team Orienteering and Profitable Tour Problems. (Rapport technique n° G-2007-31).
  - Desrosiers, C., Galinier, P., Hertz, A., & Paroz, S. (2007). Using Meta-Heuristics to Find Minimal Unsatisfiable Subformulas in Satisfiability Problems. (Rapport technique n° G-2007-08).
- 2006
  - Hertz, A., Schindl, D., & Zufferey, N. (2006). A Solution Method for a Car Fleet Management Problem with Maintenance Constraints. (Rapport technique n° G-2006-59).
  - Pepin, A.-S., Desaulniers, G., Hertz, A., & Huisman, D. (2006). Comparison of Heuristic Approaches for the Multiple Depot Vehicle Scheduling Problem. (Rapport technique n° G-2006-65).
  - Gendron, B., Hertz, A., & St-Louis, P. (2006). On Edge Orienting Methods for Graph Coloring. (Rapport technique n° G-2006-16).
  - Hertz, A., & Varone, S. (2006). The Metric Cutpoint Partition Problem. (Rapport technique n° G-2006-04).
  - Hertz, A., Plumettaz, M., & Zufferey, N. (2006). Variable Space Search for Graph Coloring. (Rapport technique n° G-2006-81).
- 2005
  - Gamache, M., Hertz, A., & Ouellet, J. O. (2005). A Graph Coloring Model for a Feasibility Problem in Crew Scheduling. (Rapport technique n° G-2005-34).
  - Lahrichi, N., Lapierre, S. D., Hertz, A., Talib, A., & Bouvier, L. (2005). Analysis of a Territorial Approach to the Delivery of Nursing Home Care Services Based on Historical Data. (Rapport technique n° G-2005-91).
  - Hertz, A., & Varone, S. C. (2005). A Note on Tree Realizations of Matrices. (Rapport technique n° G-2005-27).
  - Hertz, A. (2005). LES MÉTA-HEURISTIQUES : quelques conseils pour en faire bon usage. (Rapport technique n° G-2005-03).
  - Archetti, C., Hertz, A., & Speranza, M. G. (2005). Metaheuristics for the Team Orienteering Problem. (Rapport technique n° G-2005-47).
  - Hertz, A., & Varone, S. C. (2005). The Metric Bridge Partition Problem. (Rapport technique n° G-2005-67).
- 2004
  - Galinier, P., & Hertz, A. (2004). A Survey of Local Search Methods for Graph Coloring. (Rapport technique n° G-2004-37).
  - Desrosiers, C., Galinier, P., & Hertz, A. (2004). Efficient Algorithms for Finding Critical Subgraphs. (Rapport technique n° G-2004-31).
  - Cordeau, J.-F., Gendreau, M., Hertz, A., Laporte, G., & Sormany, J.-S. (2004). New Heuristics for the Vehicle Routing Problem. (Rapport technique n° G-2004-33).
  - Hertz, A., & Lozin, V. (2004). The Maximum Independent Set Problem and Augmenting Graphs. (Rapport technique n° G-2004-39).
- 1998
  - Gerber, M. U., Hansen, P., Hertz, A., Peled, U. N., & De Werra, D. (1998). Chopping Graphs. (Rapport technique n° G-98-03).
- 1997
  - Hertz, A., Laporte, G., Mittaz, M., & Stecke, K. E. (1997). Heuristics for Minimizing Tool Switches when Scheduling Part Types on a Flexible Machine. (Rapport technique n° G-97-03).
- 1995
  - Hansen, P., Hertz, A., & Quinodoz, N. (1995). Splitting Trees. (Rapport technique n° G-95-42).
- 1993
  - Gendreau, M., Hertz, A., & Laporte, G. (1993). A Generalized Insertion Algorithm for the Seriation Problem. (Rapport technique n° G-93-29).
  - Gendreau, M., Hertz, A., & Laporte, G. (1993). A Generalized Insertion Algorithm for the Seriation Problem. (Rapport technique n° G-93-29).
- 1992
  - Hertz, A., Jaumard, B., & Poggi De Aragão, M. (1992). Local Optima Topology for the k-coloring Problem. (Rapport technique n° G-91-33).
- 1991
  - Hertz, A. (1991). A New Polynomial Time Algorithm for the Maximum Weighted ( (G) - 1)-Coloring Problem in Comparability Graphs. (Rapport technique n° G-91-38).
  - Gendreau, M., Hertz, A., & Laporte, G. (1991). A Tabu Search Heuristic for the Vehicle Routing Problem. (Rapport technique n° G-91-31).
  - Hammer, P. L., & Hertz, A. (1991). On a Transformation which Preserves the Stability Number. (Rapport technique n° G-91-40).

Répertoire des expertises

Hertz, Alain

Répertoire des expertises

Hertz, Alain

Vous êtes ici

Publications par type

Alain Hertz (225)