 | Up a level |
Alain HertzDepartment of Mathematics and Industrial Engineering
Profile in the Directory of Experts of Polytechnique Montréal
Collaboration networkThis graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
Word cloudA word cloud is a visual representation of the most frequently used words in a text or a set of texts. The words appear in different sizes, with the size of each word being proportional to its frequency of occurrence in the text. The more frequently a word is used, the larger it appears in the word cloud. This technique allows for a quick visualization of the most important themes and concepts in a text.
In the context of this page, the word cloud was generated from the publications of the author {}. The words in this cloud come from the titles, abstracts, and keywords of the author's articles and research papers. By analyzing this word cloud, you can get an overview of the most recurring and significant topics and research areas in the author's work.
The word cloud is a useful tool for identifying trends and main themes in a corpus of texts, thus facilitating the understanding and analysis of content in a visual and intuitive way.
Audet, C., Gervais-Dubé, M., Hertz, A., Le Digabel, S., & Legrain, A. (2025). Scheduling ISMP 2024. (Technical Report n° G-2025-35). External link
Azeuli Nkamegni, K., Gamache, M., Hertz, A., & Paroz, S. (2017). Optimizing keyword positions for search engine marketing. (Technical Report n° G-2017-26). External link
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. External link
Altinakar, S., Caporossi, G., & Hertz, A. (2016). Symmetry breaking constraints for the minimum deficiency problem. (Technical Report n° G-2016-11). External link
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. External link
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. Available
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. External link
Aouchiche, M., Hansen, P., Hertz, A., & Sellal, C. (2015). Bounds on differences between some graph theoretic invariants. (Technical Report n° G-2015-31). External link
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. (Technical Report n° G-2015-04). External link
Archetti, C., Bianchessi, N., Hertz, A., Colombet, A., & Gagnon, F. (2012, August). Directed weighted improper coloring for cellular channel allocation [Paper]. 8th International Colloquium on Graphs and Optimization (GO VIII), Leukerbad, Switzerland. Published in Discrete Applied Mathematics, 182(19). External link
Altinakar, S., Caporossi, G., & Hertz, A. (2014). A comparison of integer and constraint programming models for the deficiency problem. (Technical Report n° G-2014-25). External link
Adegbindin, M., Hertz, A., & Bellaïche, M. (2014). A new efficient RLF-like algorithm for the vertex coloring problem. (Technical Report n° G-2014-24). External link
Archetti, C., Bianchessi, N., & Hertz, A. (2014). A branch-and-price algorithm for the robust graph coloring problem. Discrete Applied Mathematics, 165, 49-59. External link
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. External link
Archetti, C., Bianchessi, N., Speranza, M. G., & Hertz, A. (2014). The Split Delivery Capacitated Team Orienteering Problem. Networks, 63(1), 16-33. External link
Archetti, C., Bianchessi, N., & Hertz, A. (2012). A Branch-and-Price Algorithm for the Robust Graph Coloring Problem. (Technical Report n° G-2011-75). External link
Archetti, C., Bianchessi, N., Hertz, A., Colombet, A., & Gagnon, F. (2012). Directed Weighted Improper Coloring for Cellular Channel Allocation. (Technical Report n° G-2012-85). External link
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. External link
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. External link
Archetti, C., Bianchessi, N., Hertz, A., & Speranza, M. G. (2011). Incomplete Service and Split Deliveries in a Routing Problem with Profits. (Technical Report n° G-2011-02). External link
Archetti, C., Bianchessi, N., Hertz, A., & Speranza, M. G. (2010). The Split Delivery Capacitated Team Orienteering Problem. (Technical Report n° G-2010-55). External link
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. External link
Altinakar, S., Caporossi, G., & Hertz, A. (2009). On Compact k-Edge-Colorings: A Polynomial Time Reduction From Linear to Cyclic. (Technical Report n° G-2009-53). External link
Archetti, C., Feillet, D., Hertz, A., & Speranza, M. G. (2009). The Capacitated Arc Routing Problem with Profits. (Technical Report n° G-2009-01). External link
Archetti, C., Bertazzi, L., & Hertz, A. (2009). A Hybrid Heuristic for an Inventory-Touring Problem. (Technical Report n° G-2009-04). External link
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. External link
Altinakar, S., Caporossi, G., & Hertz, A. (2009). On compact edge-colorings : a polynomial time reduction from k-linear to k-cyclic [Abstract]. Combinatorics Seminar (1 page). External link
Archetti, C., Feillet, D., Hertz, A., & Speranza, M. G. (2007). The Capacitated Team Orienteering and Profitable Tour Problems. (Technical Report n° G-2007-31). External link
Archetti, C., Hertz, A., & Speranza, M. G. (2007). Metaheuristics for the Team Orienteering Problem. Journal of Heuristics, 13(1), 49-76. External link
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. External link
Archetti, C., Hertz, A., & Speranza, M. G. (2005). Metaheuristics for the Team Orienteering Problem. (Technical Report n° G-2005-47). External link
Avis, D., Hertz, A., & Marcotte, O. (eds.) (2005). Graph Theory and Combinatorial Optimization. External link
Archetti, C., Hertz, A., & Speranza, M. G. (2003). A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. (Technical Report n° G-2003-18). External link
Avanthay, C., Hertz, A., & Zufferey, N. (2003). A Variable Neighborhood Search for Graph Coloring. European Journal of Operational Research, 151(2), 379-388. External link
Anily, S., Bramel, J., & Hertz, A. (1999). A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems. Operations Research Letters, 24(1-2), 29-35. External link
Bonte, S., Devillez, G., Dusollier, V., Hertz, A., & Mélot, H. (2026). Extremal Chemical Graphs of Maximum Degree at Most 3 for 33 Degree-Based Topological Indices. match Communications in Mathematical and in Computer Chemistry, 95(1), 193-231. External link
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. (Technical Report n° G-2025-05). External link
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. External link
Bentz, C., Costa, M.-C., & Hertz, A. (2020). On the edge capacitated Steiner tree problem. Discrete Optimization, 38, 25 pages. External link
Bürgy, R., Baptiste, P., & Hertz, A. (2019). An exact dynamic programming algorithm for the precedence-constrained class sequencing problem. (Technical Report n° G-2017-82). External link
Bécotte-Boutin, H.-S., Caporossi, G., Hertz, A., & Leblay, C. (2019). Writing and rewriting: the colored numerical visualization of Keystroke logging. In Lingdgren, E., & Sullivan, K. P. H. (eds.), Observing writing: insights from Keystroke logging and handwriting (pp. 96-114). External link
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. External link
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. External link
Bentz, C., Costa, M.-C., & Hertz, A. (2016). On the edge capacitated Steiner tree problem. (Technical Report n° G-2016-27). External link
Baptiste, P., Bürgy, R., Hertz, A., & Rebaïne, D. (2016). Online heuristics for unloading boxes off a gravity conveyor. (Technical Report n° G-2016-20). External link
Bécotte-Boutin, H.-S., Caporossi, G., & Hertz, A. (2015). The progressive visualization, a new tool for analyzing the writing process. (Technical Report n° G-2015-141). External link
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. External link
Baptiste, P., Hertz, A., Linhares, A., & Rebaïne, D. (2012). A polynomial time algorithm for unloading boxes off a gravity conveyor. (Technical Report n° G-2012-78). External link
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. External link
Bouchard, M., Čangalović, M., & Hertz, A. (2009). About equivalent interval colorings of weighted graphs. Discrete Applied Mathematics, 157(17), 3615-3624. External link
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. External link
Bouchard, M., Čangalović, M., & Hertz, A. (2008). About Equivalent Interval Colorings of Weighted Graphs. (Technical Report n° G-2008-03). External link
Bouchard, M., Čangalović, M., & Hertz, A. (2007). On a Reduction of the Interval Coloring Problem to a Series of Bandwidth Coloring Problems. (Technical Report n° G-2007-69). External link
Bouchard, M., Hertz, A., & Desaulniers, G. (2007). Lower Bounds and a Tabu Search Algorithm for the Minimum Deficiency Problem. (Technical Report n° G-2007-14). External link
Contardo, C., & Hertz, A. (2021). An exact algorithm for a class of geometric set-cover problems. Discrete Applied Mathematics, 300, 25-35. External link
Contardo, C., & Hertz, A. (2020). An exact algorithm for a class of geometric set-cover problems. (Technical Report n° G-2020-17). External link
Curzi, L., Hertz, A., & Lari, I. (2012). A Repeated Sequential Elimination Algorithm for Finding an Upper Bound on the Clique Number. (Technical Report n° G-2012-80). External link
Carreau, M., Morgenroth, M., Belashov, O., Mdimagh, A., Hertz, A., & Marcotte, O. (2010, September). Wind farm design optimization [Paper]. 21st World Energy Congress, Montréal, Québec. External link
Cordeau, J.-F., Gendreau, M., Hertz, A., Laporte, G., & Sormany, J.-S. (2005). New heuristics for the vehicle routing problem. In Langevin, A., & Riopel, D. (eds.), Logistics systems : design and optimization (pp. 279-297). External link
Cordeau, J.-F., Gendreau, M., Hertz, A., Laporte, G., & Sormany, J.-S. (2004). New Heuristics for the Vehicle Routing Problem. (Technical Report n° G-2004-33). External link
Costa, M.-C., Hertz, A., & Mittaz, M. (2002). Bounds and heuristics for the shortest capacitated paths problem. Journal of Heuristics, 8(4), 449-465. External link
Calégari, P., Coray, G., Hertz, A., Kobler, D., & Kuonen, P. (1999). A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization. Journal of Heuristics, 5(2), 145-158. External link
Costa, D., Hertz, A., & Dubuis, C. (1995). Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs. Journal of Heuristics, 1(1), 105-128. External link
Dusollier, V., Bonte, S., Devillez, G., Hertz, A., Mélot, H., & Schindl, D. (2025). Complete polyhedral description of chemical graphs of maximum degree at most 3. (Technical Report n° G-2025-43). External link
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. External link
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. (Technical Report n° G-2018-69). External link
de Werra, D., & Hertz, A. (2015). Chromatic scheduling. In Beineke, L. W., & Wilson, R. J. (eds.), Topics in chromatic graph theory (pp. 255-276). External link
Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (2014). Automated generation of conjectures on forbidden subgraph characterization. Discrete Applied Mathematics, 162, 177-194. External link
De Werra, D., & Hertz, A. (2013). Chromatic Scheduling. (Technical Report n° G-2013-84). External link
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. External link
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. External link
Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (2008). SyGMA: Reducing Symmetry in Graph Mining. (Technical Report n° G-2007-12). External link
Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (2008). Using Heuristics to Speed Up Frequent Pattern Mining. (Technical Report n° G-2008-13). External link
Desrosiers, C., Galinier, P., & Hertz, A. (2008). Efficient Algorithms for Finding Critical Subgraphs. Discrete Applied Mathematics, 156(2), 244-266. External link
Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (2007). Automated Generation of Conjectures on Forbidden Subgraph Characterization. (Technical Report n° G-2007-48). External link
Desrosiers, C., Galinier, P., Hertz, A., & Paroz, S. (2007). Using Meta-Heuristics to Find Minimal Unsatisfiable Subformulas in Satisfiability Problems. (Technical Report n° G-2007-08). External link
Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (2007, August). Improving frequent subgraph mining in the presence of symmetry [Paper]. 5th International Workshop on Mining and Learning with Graphs, Firenze, Italia. External link
Desrosiers, C., Galinier, P., & Hertz, A. (2004). Efficient Algorithms for Finding Critical Subgraphs. (Technical Report n° G-2004-31). External link
De Werra, D., & Hertz, A. (1995). A partial view of OR in Switzerland. European Journal of Operational Research, 87(3), 471-473. External link
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. External link
Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (2008). Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints. (Technical Report n° G-2008-02). External link
Galinier, P., Hertz, A., & Zufferey, N. (2008). An Adaptive Memory Algorithm for the K-Coloring Problem. Discrete Applied Mathematics, 156(2), 267-279. External link
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. External link
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. External link
Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (2008, May). Using local search to speed up filtering algorithms for some NP-hard constraints [Paper]. 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), Paris, France. External link
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. (Technical Report n° G-2007-22). External link
Gendron, B., Hertz, A., & St-Louis, P. (2007). A Decomposition Algorithm for Computing Bounds on the Clique Number of a Graph. (Technical Report n° G-2007-01). External link
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. External link
Gendron, B., Hertz, A., & St-Louis, P. (2007). On Edge Orienting Methods for Graph Coloring. Journal of Combinatorial Optimization, 13(2), 163-178. External link
Galinier, P., & Hertz, A. (2007). Solution Techniques for the Large Set Covering Problem. Discrete Applied Mathematics, 155(3), 312-326. External link
Gendron, B., Hertz, A., & St-Louis, P. (2006). On Edge Orienting Methods for Graph Coloring. (Technical Report n° G-2006-16). External link
Gerber, M. U., Hertz, A., & Lozin, V. (2006). Augmenting Chains in Graphs Without a Skew Star. Journal of Combinatorial Theory: Series B, 96(3), 352-366. External link
Galinier, P., & Hertz, A. (2006). A survey of local search methods for graph coloring. Computers & Operations Research, 33(9), 2547-2562. External link
Gamache, M., Hertz, A., & Ouellet, J. O. (2005). A Graph Coloring Model for a Feasibility Problem in Crew Scheduling. (Technical Report n° G-2005-34). External link
Galinier, P., Hertz, A., & Zufferey, N. (2004). An Adaptive Memory Algorithm for the k-Colouring Problem. (Technical Report n° G-2003-35). External link
Galinier, P., & Hertz, A. (2004). A Survey of Local Search Methods for Graph Coloring. (Technical Report n° G-2004-37). External link
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. External link
Gerber, M. U., Hertz, A., & Lozin, V. (2004). Stable Sets in Two Subclasses of Banner-Free Graphs. Discrete Applied Mathematics, 132(1-3), 121-136. External link
Gerber, M. U., Hertz, A., & Lozin, V. (2003). Augmenting Chains in Graphs Without a Skew Star. (Technical Report n° G-2003-47). External link
Galinier, P., & Hertz, A. (2003). Solution Techniques for the Large Set Covering Problem. (Technical Report n° G-2003-44). External link
Gerber, M. U., Hertz, A., & Schindl, D. (2002). P5-Free Augmenting Graphs and the Maximum Stable Set Problem. (Technical Report n° G-2002-11). External link
Gerber, M. U., Hertz, A., & Lozin, V. (2002). Stable Sets in Two Subclasses of Banner-Free Graphs. (Technical Report n° G-2002-08). External link
Galinier, P., Hertz, A., & Zufferey, N. (2002, January). Adaptative memory algorithms for graph coloring [Paper]. Computational Symposium on Graph Coloring and Generalizations (COLOR 2002), Ithaca,US. Unavailable
Gerber, M., Hansen, P., & Hertz, A. (2002). Extension of Turan's theorem to the 2-stability number. Graphs and Combinatorics, 18(3), 479-489. External link
Ghiani, G., Hertz, A., & Laporte, G. (2002). Recent algorithmic advances for arc routing problems. In Kozan, E., & Ohuchi, A. (eds.), Operations research/management science at work (Vol. 43, pp. 1-20). External link
Ghiani, G., Hertz, A., & Laporte, G. (2001). Recent Algorithmic Advances for Arc Routing Problems. (Technical Report n° G-2000-40). External link
Gerber, M. U., & Hertz, A. (2001). Transformation which preserves the clique number. Journal of Combinatorial Theory: Series B, 83(2), 320-330. External link
Gerber, M. U., Hansen, P., & Hertz, A. (1998). Extension of Turán's Theorem to the 2-Stability Number. (Technical Report n° G-98-71). External link
Gerber, M. U., Hansen, P., & Hertz, A. (1998). Local Optima Topology for the 3-SAT Problem. (Technical Report n° G-98-68). External link
Gerber, M. U., Hansen, P., Hertz, A., Peled, U. N., & De Werra, D. (1998). Chopping Graphs. (Technical Report n° G-98-03). External link
Gendreau, M., Hertz, A., & Laporte, G. (1996). The Traveling Salesman Problem with Backhauls. Computers & Operations Research, 23(5), 501-508. External link
Gendreau, M., Hertz, A., & Laporte, G. (1994). A Tabu Search Heuristic for the Vehicle Routing Problem. Management Science, 40(10), 1276-1290. External link
Gendreau, M., Hertz, A., Laporte, G., & Mihnea, S. (1994, June). Efficient heuristics for traveling salesman and vehicle problems with time windows [Paper]. 2nd Triennal Symposium on Transportation Analysis (Tristan II), Capri, Italy. External link
Gendreau, M., Hertz, A., & Laporte, G. (1994, June). A tabu search heuristic for the vehicle routing problem with backhauls [Paper]. 2nd Triennal Symposium on Transportation Analysis (Tristan II), Capri, Italy. External link
Gendreau, M., Hertz, A., & Laporte, G. (1993). A Generalized Insertion Algorithm for the Seriation Problem. (Technical Report n° G-93-29). External link
Gendreau, M., Hertz, A., & Laporte, G. (1992). New Insertion and Postoptimization Procedures for the Traveling Salesman Problem. Operations Research, 40(6), 1086-1094. External link
Gendreau, M., Hertz, A., & Laporte, G. (1991). A Tabu Search Heuristic for the Vehicle Routing Problem. (Technical Report n° G-91-31). External link
Gendreau, M., Hertz, A., & Laporte, G. (1991, June). A Tabu Search Heuristic for the Vehicle Routing Problem [Paper]. 1st Triennal Symposium on Transportation Analysis (Tristan I), Montréal, Québec. External link
Hertz, A., Kuflik, T., & Tuval, N. (2025). Investigating the Relationship Between User Preferences, Previous Ratings and User Judgments Related to Serendipity. International Journal of Human-Computer Interaction, 17 pages. External link
Hertz, A., Bonte, S., Devillez, G., Dusollier, V., Mélot, H., & Schindl, D. (2024). Extremal chemical graphs for the arithmetic-geometric index. (Technical Report n° G-2024-27). External link
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. External link
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). External link
Hertz, A. (2024, July). Extremal Chemical Graphs for the Arithmetic-Geometric Index [Abstract]. 25th International Symposium on Mathematical Programming (ISMP 2024), Montréal, QC, Canada. External link
Hertz, A. (2024). Graphs obtained by disjoint unions and joins of cliques and stable sets. RAIRO - Operations Research, 58(3), 2631-2636. Available
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. External link
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). External link
Hertz, A. (2023). Graphs obtained by disjoint unions and joins of cliques and stable sets. (Technical Report n° G-2023-59). External link
Hertz, A., Bonte, S., Devillez, G., & Mélot, H. (2022). The average size of maximal matchings in graphs. (Technical Report n° G-2022-13). External link
Hertz, A. (2022). Decycling Bipartite Graphs. Journal of Graph Algorithms and Applications, 25(1), 461-480. External link
Hertz, A., & Ries, B. (2021). Graph colouring variations. In Beineke, L. W., Golumbic, M. C., & Wilson, R. J. (eds.), Topics in Algorithmic Graph Theory (pp. 33-51). External link
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. (Technical Report n° G-2021-28). External link
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. (Technical Report n° G-2021-25). External link
Hertz, A., Hertz, A., & Mélot, H. (2021). Using graph theory to derive inequalities for the Bell numbers. (Technical Report n° G-2021-06). External link
Hertz, A., Kuflik, T., & Tuval, N. (2021). Resolving sets and integer programs for recommender systems. Journal of Global Optimization, 81(1), 153-178. External link
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). External link
Hertz, A. (2020). Decycling bipartite graphs. (Technical Report n° G-2020-43). External link
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. External link
Hertz, A., & Ridremont, T. (2020). A tabu search for the design of capacitated rooted survivable planar networks. Journal of Heuristics, 26(6), 829-850. External link
Hertz, A., & Picouleau, C. (2019). On graceful difference labelings of disjoint unions of circuits. Open Journal of Discrete Applied Mathematics, 2(3), 38-55. Available
Hertz, A., & Ries, B. (2019). Graph colouring variations. (Technical Report n° G-2019-32). External link
Hertz, A. (2019). Resolving sets and integer programs for recommender systems. (Technical Report n° G-2019-12). External link
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. External link
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. External link
Hauweele, P., Hertz, A., Mélot, H., Ries, B., & Devillez, G. (2018). Maximum eccentric connectivity index for graphs with given diameter. (Technical Report n° G-2018-66). External link
Hertz, A., & Picouleau, C. (2018). On graceful difference labelings of disjoint unions of circuits. (Technical Report n° G-2018-65). External link
Hertz, A., & Ridremont, T. (2018). A tabu search for the design of capacitated rooted survivable planar networks. (Technical Report n° G-2018-64). External link
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. External link
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. External link
Hertz, A. (2017). An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes. (Technical Report n° G-2017-17). External link
Hansen, P., Hertz, A., Sellal, C., Vukičević, D., Aouchiche, M., & Caporossi, G. (2017). Edge realizability of connected simple graphs. (Technical Report n° G-2017-10). External link
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. External link
Hertz, A., Montagné, R., & Gagnon, F. (2017). Online algorithms for the maximum k-colorable subgraph problem. Computers & Operations Research, 91, 209-224. External link
Hertz, A., Montagné, R., & Gagnon, F. (2016). Integer programming models for the partial directed weighted improper coloring problem. (Technical Report n° G-2016-112). External link
Hertz, A., Montagné, R., & Gagnon, F. (2016). Online algorithms for the maximum k-colorable subgraph problem. (Technical Report n° G-2016-111). External link
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. (Technical Report n° G-2015-23). External link
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. Available
Hertz, A., & Mélot, H. (2016). Counting the number of non-equivalent vertex colorings of a graph. Discrete Applied Mathematics, 203, 62-71. External link
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. External link
Hertz, A. (2016). Dessine-moi un graphe. Accromath, 11(1), 8-13. External link
Hertz, A., Montagné, R., & Gagnon, F. (2015). Constructive algorithms for the partial directed weighted improper coloring problem. (Technical Report n° G-2015-61). External link
Hertz, A., Lozin, V., Ries, B., Zamaraev, V., & De Werra, D. (2015). Dominating induced matchings in graphs containing no long claw. (Technical Report n° G-2015-49). External link
Hertz, A. (2014). Graphiti - L'inspecteur Manori enquête à Paris. Unavailable
Hertz, A., & Ries, B. (2014). A note on r-equitable k-colorings of trees. Yugoslav Journal of Operations Research, 24(2), 293-298. Available
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. Available
Hertz, A., & Mélot, H. (2013). Counting the Number of Non-Equivalent Vertex Colorings of a Graph. (Technical Report n° G-2013-82). External link
Hertz, A., & Ries, B. (2013). A Note on r-Equitable k-Colorings of Trees. (Technical Report n° G-2013-83). External link
Hertz, A. (2012). Quick on the draw : crime-busting with a mathematical twist. External link
Hertz, A., Marcotte, O., Mdimagh, A., Carreau, M., & Welt, F. (2012). Optimizing the Design of a Wind Farm Collection Network. (Technical Report n° G-2011-79). External link
Hertz, A. (2012). L'enseignement de la théorie des graphes à l'aide d'intrigues policières. Bulletin de l'APMEP, 499, 290-296. External link
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. External link
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. External link
Hertz, A., & Ries, B. (2011). On r-Equitable Colorings of Trees and Forests. (Technical Report n° G-2011-40). External link
Hertz, A., Uldry, M., & Widmer, M. (2011). Integer Linear Programming Models for a Cement Delivery Problem. (Technical Report n° G-2011-20). External link
Hertz, A. (2011). Der Graf der Graphen : Kriminalistische Verwicklungen mit mathematischer Pointe. External link
Hertz, A. (2010). L'agrapheur : intrigues policières à saveur mathématique. External link
Hertz, A., & Razanakoto, R. (2010). Confection de calendriers de matchs pour le sport universitaire et collégial au Québec. (Technical Report n° G-2010-04). External link
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. External link
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. External link
Hertz, A., & Zufferey, N. (2010). Vertex coloring using ant colonies. In Artificial ants : from collective intelligence to real-life optimization and beyond (pp. 219-236). External link
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. External link
Hertz, A., & Zuffery, N. (2009). La coloration des sommets d'un graphe par colonies de fourmis. In Fourmis artificielles, des bases de l'optimisation aux applications industrielles . External link
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. External link
Hertz, A., & De Werra, A. (2009). A magnetic procedure for the stability number. Graphs and Combinatorics, 25(5), 707-716. External link
Hertz, A., & Lahrichi, N. (2009). A Patient Assignment Algorithm for Home Care Services. Journal of the Operational Research Society, 60(4), 481-495. External link
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. External link
Hansen, P., Hertz, A., Kilani, R., Marcotte, O., & Schindl, D. (2008). Average Distance and Maximum Induced Forest. (Technical Report n° G-2007-07). External link
Hertz, A., & Zufferey, N. (2008). La coloration des sommets d'un graphe par colonies de fourmis. (Technical Report n° G-2008-29). External link
Hertz, A., Lahrichi, N., & Widmer, M. (2008). A Flexible MILP Model for Multiple-Shift Workforce Planning Under Annualized Hours. (Technical Report n° G-2008-05). External link
Hertz, A., & Varone, S. (2008). The Metric cutpoint partition problem. Journal of Classification, 25(2), 159-175. External link
Hertz, A., & Mittaz, M. (2008). Pickup and delivery problems with services on nodes or arcs of a network. In Operations research and networks (pp. 165-188). External link
Hertz, A., Plumettaz, M., & Zufferey, N. (2008). Variable Space Search for Graph Coloring. Discrete Applied Mathematics, 156(13), 2551-2560. External link
Hertz, A., & Lahrichi, N. (2007). A Patient Assignment Algorithm for Home Care Services. (Technical Report n° G-2006-80). External link
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. External link
Hertz, A., & Varone, S. C. (2007). A Note on Tree Realizations of Matrices. RAIRO: Operations Research, 41(4), 361-366. External link
Hertz, A., Plumettaz, M., & Zufferey, N. (2006). Variable Space Search for Graph Coloring. (Technical Report n° G-2006-81). External link
Hertz, A., Schindl, D., & Zufferey, N. (2006). A Solution Method for a Car Fleet Management Problem with Maintenance Constraints. (Technical Report n° G-2006-59). External link
Hertz, A., & Varone, S. (2006). The Metric Cutpoint Partition Problem. (Technical Report n° G-2006-04). External link
Hertz, A. (2005). Les métaheuristiques : quelques conseils pour en faire bon usage. In Baptiste, P., Giard, V., Haït, A., & Soumis, F. (eds.), Gestion de production et ressources humaines : méthodes de planification dans les systèmes productifs (pp. 205-222). External link
Hertz, A., & Varone, S. C. (2005). The Metric Bridge Partition Problem. (Technical Report n° G-2005-67). External link
Hertz, A. (2005). Recent Trends in Arc Routing. In Graph Theory, Combinatorics and Algorithms (Vol. 34, pp. 215-236). External link
Hertz, A., & Varone, S. C. (2005). A Note on Tree Realizations of Matrices. (Technical Report n° G-2005-27). External link
Hertz, A. (2005). LES MÉTA-HEURISTIQUES : quelques conseils pour en faire bon usage. (Technical Report n° G-2005-03). External link
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. External link
Hertz, A. Recent Trends in Arc Routing [Paper]. Haifa Workshops on Interdisciplinary Applications of Graph Theory, Combinatorics and Algorithms, Haifa, Israel. Unavailable
Hertz, A., Schindl, D., & Zufferey, N. (2004). Lower Bounding and Tabu Search Procedures for the Frequency Assignment Problem with Polarization Constraints. (Technical Report n° G-2003-42). External link
Hertz, A., & Lozin, V. (2004). The Maximum Independent Set Problem and Augmenting Graphs. (Technical Report n° G-2004-39). External link
Hertz, A., Lozin, V., & Schindl, D. (2003). Finding Augmenting Chains in Extensions of Claw-Free Graphs. Information Processing Letters, 86(6), 311-316. External link
Hertz, A., & Widmer, M. (2003). Guidelines for the use of meta-heuristics in combinatorial optimization. European Journal of Operational Research, 151(2), 247-252. External link
Hertz, A., & Widmer, M. (2002). Guidelines for the Use of Meta-Heuristics in Combinatorial Optimization. (Technical Report n° G-2002-60). External link
Hertz, A. (2002). Recent Trends in Arc Routing. (Technical Report n° G-2002-51). External link
Hertz, A., Lozin, V., & Schindl, D. (2002). Finding Augmenting Chains in Extensions of Claw-Free Graphs. (Technical Report n° G-2002-42). External link
Herrmann, F., & Hertz, A. (2002). Finding the chromatic number by means of critical graphs. Journal of Experimental Algorithmics, 7(10), 1-9. External link
Hertz, A. (2002). Operations research in logistics. In The essentials of logistics and management (pp. 253-279). Unavailable
Hertz, A., & Mittaz, M. (2002). Tournées de livraisons et de ramassages sur les noeuds ou les arcs d'un réseau. In Recherche opérationnelle et réseaux: méthodes d'analyse spatiale (pp. 167-189). Unavailable
Hertz, A. (2001). Application des métaheuristiques à la coloration des sommets d'un graphe. In Pirlot, M., & Teghem, J. (eds.), Résolution de problèmes de RO par les métaheuristiques (pp. 21-48). External link
Hertz, A., & Mittaz, M. (2001). Variable neighbourhood descent algorithm for the undirected capacitated arc routing problem. Transportation Science, 35(4), 425-434. External link
Hertz, A., & Kobler, D. (2000). A framework for the description of evolutionary algorithms. European Journal of Operational Research, 126(1), 12 pages. External link
Herrmann, F., & Hertz, A. (2000). Finding the chromatic number by means of critical graphs. Electronic Notes in Discrete Mathematics, 5, 174-176. External link
Hertz, A., Laporte, G., & Mittaz, M. (2000). A Tabu Search Heuristic for the Capacitated arc Routing Problem. Operations Research, 48(1), 129-135. External link
Hertz, A., Robert, V., & Berthod, V. (2000). Planification des Emplois du Temps et de la Formation au Sein d'une Grande Entreprise. RAIRO - Operations Research, 34(1), 61-83. External link
Hertz, A., & Mittaz, M. (2000). Heuristic Algorithms. In Dror, M. (ed.), Arc Routing (pp. 327-386). External link
Hertz, A. (1999). On perfect switching classes. Discrete Applied Mathematics, 94(1-3), 3-7. External link
Hertz, A. (1998). On perfect switching classes. Discrete Applied Mathematics, 89(1-3), 263-267. External link
Hertz, A., & Robert, V. (1998). Constructing a course schedule by solving a series of assignment type problems. European Journal of Operational Research, 108(3), 585-603. External link
Hertz, A., Laporte, G., Mittaz, M., & Stecke, K. E. (1997). Heuristics for Minimizing Tool Switches when Scheduling Part Types on a Flexible Machine. (Technical Report n° G-97-03). External link
Hertz, A. (1997). On the use of Boolean methods for the computation of the stability number. Discrete Applied Mathematics, 76(1-3), 183-203. External link
Hansen, P., Hertz, A., & Quinodoz, N. (1997). Splitting trees. Discrete Mathematics, 165-166, 403-419. External link
Hertz, A., & Widmer, M. (1996). An improved tabu search approach for solving the job shop scheduling problem with tooling constraints. Discrete Applied Mathematics, 65(1-3), 319-345. External link
Hertz, A., Mottet, Y., & Rochat, Y. (1996). On a scheduling problem in a robotized analytical system. Discrete Applied Mathematics, 65(1-3), 285-318. External link
Hansen, P., Hertz, A., & Quinodoz, N. (1995). Splitting Trees. (Technical Report n° G-95-42). External link
Hertz, A. (1995). Polynomially solvable cases for the maximum stable set problem. Discrete Applied Mathematics, 60(1-3), 195-210. External link
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. External link
Hertz, A., Jaumard, B., & Poggi De Aragão, M. Local optima topology for the k-coloring problem [Paper]. Viewpoints on Optimization; and Graph Labelling, Grimentz, Switzerland; Boston, Mass. Published in Discrete Applied Mathematics, 49(1-3). External link
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. External link
Hertz, A. (1993). Most unbreakable murky graphs are bull-free. Graphs and Combinatorics, 9(2-4), 173-175. External link
Hansen, P., Hertz, A., & Kuplinsky, J. (1993). Bounded vertex colorings of graphs. Discrete Mathematics, 111(1-3), 305-312. External link
Hertz, A. (1992). Finding a feasible course schedule using Tabu search. Discrete Applied Mathematics, 35(3), 255-270. External link
Hertz, A., Jaumard, B., & Poggi De Aragão, M. (1992). Local Optima Topology for the k-coloring Problem. (Technical Report n° G-91-33). External link
Hammer, P. L., & Hertz, A. (1991). On a Transformation which Preserves the Stability Number. (Technical Report n° G-91-40). External link
Hertz, A. (1991). A New Polynomial Time Algorithm for the Maximum Weighted ( (G) - 1)-Coloring Problem in Comparability Graphs. (Technical Report n° G-91-38). External link
Kis, T., & Hertz, A. (2003). A Lower Bound for the Job Insertion Problem. Discrete Applied Mathematics, 128(2-3), 395-419. External link
Liu, D., Lodi, A., Hertz, A., & Perreault, V. (2024, July). A machine learning approach for neighbor generation in metaheuristic search [Abstract]. 25th International Symposium on Mathematical Programming (ISMP 2024), Montréal, QC, Canada. External link
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. Available
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. External link
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. (Technical Report n° G-2005-91). External link
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. (Technical Report n° G-2022-63). External link
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. External link
Montagné, R., Hertz, A., & Gagnon, F. (2014). Graph coloring to maximize the number of communicating mobiles in wireless networks. (Technical Report n° G-2014-79). External link
Marcotte, O., Hertz, A., & Schindl, D. (2011). On the Maximum Orders of an Induced Forest, an Induced Tree, and a Stable Set. (Technical Report n° G-2011-45). External link
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). Available
Perreault, V., Hertz, A., & Lodi, A. (2023). Tactical wireless network design with multi-beam antennas. (Technical Report n° G-2023-34). External link
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. External link
Pepin, A.-S., Desaulniers, G., Hertz, A., & Huisman, D. (2006). Comparison of Heuristic Approaches for the Multiple Depot Vehicle Scheduling Problem. (Technical Report n° G-2006-65). External link
Randel, R., Aloise, D., & Hertz, A. (2023, April). A Lagrangian-based approach to learn distance metrics for clustering with minimal data transformation [Paper]. SIAM International Conference on Data Mining (SDM 2023), Minneapolis, MN, USA. External link
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. Available
Randel, R., Aloise, D., & Hertz, A. (2021). Exploring dual information in distance metric learning for clustering. (Technical Report n° G-2021-32). External link
Randel, R., Aloise, D., Blanchard, S., & Hertz, A. (2019). A Lagrangian-based score for assessing the quality of pairwise constraints in SSC. (Technical Report n° G-2019-96). External link
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. Available
Rybarczyk, A., Hertz, A., Kasprzak, M., & Blazewicz, J. (2016). Tabu search for the RNA partial degradation problem. (Technical Report n° G-2016-07). External link
Robert, V., & Hertz, A. (1995, August). How to decompose constrained course scheduling problems into easier assignment type subproblems [Paper]. 1st International Conference on the Practice and Theory of Automated Timetabling, Edinburgh, UK. Published in Lecture notes in computer science. External link
Solomon, A., Wecker, A., Tuval, N., Hertz, A., & Kuflik, T. (2026, March). A Privacy-Preserving Hypercube Framework for Interactive Recommendations [Paper]. 31st International Conference on Intelligent User Interfaces (IUI 2026), Paphos, Cyprus. External link
St-Louis, P., Gendron, B., & Hertz, A. (2012). Total domination and the Caccetta–Häggkvist conjecture. Discrete Optimization, 9(4), 236-240. External link
St-Louis, P., Gendron, B., & Hertz, A. (2009). Total Domination and the Caccetta-Häggkvist Conjecture. (Technical Report n° G-2009-78). External link
Solot, P., Willmann, L., Dudás, T., Hertz, A., & Kis, T. (1999). Kapazitätsoptimierung von Mehrzweckanlagen mittels evolutionärer Algorithmen. [Presentation]. Chemie Ingenieur Technik, 71(9), 1029-1030. Presented at GVC-Jahrestagung, Leipzig, Germany. External link
Tuval, N., Hertz, A., & Kuflik, T. (2025). Addressing the cold start problem in privacy preserving content-based recommender systems using hypercube graphs. RAIRO. Operations research, 3891-3911. External link
Tuval, N., Hertz, A., & Kuflik, T. (2023). Estimating serendipity in content-based recommender systems. (Technical Report n° G-2023-35). External link
Tuval, N., Hertz, A., & Kuflik, T. (2022). Addressing the cold start problem in privacy preserving content-based recommender systems using hypercube graphs. (Technical Report n° G-2022-55). External link
Wecker, A. J., Tuval, N., Hertz, A., Mahamid, M., & Kuflik, T. (2024, October). A roadmap for privacy preserving tourist recommendation system [Paper]. Workshop on Recommenders in Tourism (RecTour 2024), Bari, Italy. External link
Widmer, M., Hertz, A., & Costa, D. (2008). Metaheuristics and Scheduling. In Production Scheduling (pp. 33-68). External link
Widmer, M., Bugnon, B., Varone, S., & Hertz, A. (1997). Rhythmed Flow Shop : How to Balance the Daily Workload. IFAC Proceedings Volumes, 30(19), 245-248. External link
Widmer, M., & Hertz, A. (1989). A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research, 41(2), 186-193. External link
