default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlain Hertz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j134]Alain Hertz
, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot:
The average size of maximal matchings in graphs. J. Comb. Optim. 47(3): 46 (2024)- [j133]Alain Hertz:
Graphs obtained by disjoint unions and joins of cliques and stable sets. RAIRO Oper. Res. 58(3): 2631-2636 (2024) - [i12]Alain Hertz, Sébastien Bonte, Gauvain Devillez, Valentin Dusollier, Hadrien Mélot, David Schindl:
Extremal Chemical Graphs for the Arithmetic-Geometric Index. CoRR abs/2403.05226 (2024) - 2023
- [j132]Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez:
Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph. Discret. Appl. Math. 335: 69-81 (2023) - [j131]Defeng Liu, Vincent Perreault, Alain Hertz, Andrea Lodi:
A machine learning framework for neighbor generation in metaheuristic search. Frontiers Appl. Math. Stat. 9 (2023) - [j130]Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez, Pierre Hauweele:
Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph. Graphs Comb. 39(3): 49 (2023) - [c5]Rodrigo Randel, Daniel Aloise, Alain Hertz:
A Lagrangian-based approach to learn distance metrics for clustering with minimal data transformation. SDM 2023: 127-135 - [i11]Noa Tuval, Alain Hertz, Tsvi Kuflik:
Addressing the cold start problem in privacy preserving content-based recommender systems using hypercube graphs. CoRR abs/2310.09341 (2023) - 2022
- [i10]Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot:
The average size of maximal matchings in graphs. CoRR abs/2204.10236 (2022) - [i9]Defeng Liu, Vincent Perreault, Alain Hertz, Andrea Lodi:
A machine learning framework for neighbor generation in metaheuristic search. CoRR abs/2212.11451 (2022) - 2021
- [j129]Claudio Contardo, Alain Hertz:
An exact algorithm for a class of geometric set-cover problems. Discret. Appl. Math. 300: 25-35 (2021) - [j128]Rodrigo Randel, Daniel Aloise, Simon J. Blanchard, Alain Hertz:
A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering. Data Min. Knowl. Discov. 35(6): 2341-2368 (2021) - [j127]Alain Hertz:
Decycling bipartite graphs. J. Graph Algorithms Appl. 25(1): 461-480 (2021) - [j126]Alain Hertz, Tsvi Kuflik, Noa Tuval:
Resolving sets and integer programs for recommender systems. J. Glob. Optim. 81(1): 153-178 (2021) - [i8]Alain Hertz, Anaelle Hertz, Hadrien Mélot:
Using Graph Theory to Derive Inequalities for the Bell Numbers. CoRR abs/2104.00552 (2021) - [i7]Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez:
Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph. CoRR abs/2104.14172 (2021) - [i6]Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez, Pierre Hauweele:
Upper bounds on the average number of colors in the non-equivalent colorings of a graph. CoRR abs/2105.01120 (2021) - [i5]Rodrigo Randel, Daniel Aloise, Alain Hertz:
Exploring dual information in distance metric learning for clustering. CoRR abs/2105.12703 (2021) - 2020
- [j125]Reinhard Bürgy, Alain Hertz, Pierre Baptiste:
An exact dynamic programming algorithm for the precedence-constrained class sequencing problem. Comput. Oper. Res. 124: 105063 (2020) - [j124]Cédric Bentz, Marie-Christine Costa, Alain Hertz:
On the edge capacitated Steiner tree problem. Discret. Optim. 38: 100607 (2020) - [j123]Alain Hertz, Thomas Ridremont:
A tabu search for the design of capacitated rooted survivable planar networks. J. Heuristics 26(6): 829-850 (2020) - [j122]Alain Hertz:
An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes. Optim. Lett. 14(2): 355-367 (2020)
2010 – 2019
- 2019
- [j121]Alain Hertz, Romain Montagné, François Gagnon:
A comparison of integer programming models for the partial directed weighted improper coloring problem. Discret. Appl. Math. 261: 229-245 (2019) - [j120]Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez:
Maximum eccentric connectivity index for graphs with given diameter. Discret. Appl. Math. 268: 102-111 (2019) - 2018
- [j119]Alain Hertz, Romain Montagné, François Gagnon:
Online algorithms for the maximum k-colorable subgraph problem. Comput. Oper. Res. 91: 209-224 (2018) - [j118]Romain Absil, Eglantine Camby, Alain Hertz, Hadrien Mélot:
A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree. Discret. Appl. Math. 234: 3-11 (2018) - [j117]Alain Hertz, Vadim V. Lozin, Bernard Ries, Viktor Zamaraev, Dominique de Werra:
Dominating induced matchings in graphs containing no long claw. J. Graph Theory 88(1): 18-39 (2018) - [i4]Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez:
Maximum Eccentric Connectivity Index for Graphs with Given Diameter. CoRR abs/1808.10203 (2018) - [i3]Gauvain Devillez, Alain Hertz, Hadrien Mélot, Pierre Hauweele:
Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices. CoRR abs/1809.03158 (2018) - 2017
- [j116]Agnieszka Rybarczyk, Alain Hertz, Marta Kasprzak, Jacek Blazewicz:
Tabu Search for the RNA Partial Degradation Problem. Int. J. Appl. Math. Comput. Sci. 27(2): 401 (2017) - [j115]Pierre Baptiste, Reinhard Bürgy, Alain Hertz, Djamal Rebaine:
Online heuristics for unloading boxes off a gravity conveyor. Int. J. Prod. Res. 55(11): 3046-3057 (2017) - [j114]Sivan Altinakar, Gilles Caporossi, Alain Hertz:
Symmetry Breaking Constraints for the Minimum Deficiency Problem. J. Graph Algorithms Appl. 21(2): 195-218 (2017) - [j113]Alain Hertz, Odile Marcotte, Asma Mdimagh, Michel Carreau, François Welt:
Design of a wind farm collection network when several cable types are available. J. Oper. Res. Soc. 68(1): 62-73 (2017) - 2016
- [j112]Sivan Altinakar, Gilles Caporossi, Alain Hertz:
A comparison of integer and constraint programming models for the deficiency problem. Comput. Oper. Res. 68: 89-96 (2016) - [j111]Alain Hertz, Hadrien Mélot:
Counting the number of non-equivalent vertex colorings of a graph. Discret. Appl. Math. 203: 62-71 (2016) - [j110]Alain Hertz, Romain Montagné, François Gagnon:
Constructive algorithms for the partial directed weighted improper coloring problem. J. Graph Algorithms Appl. 20(2): 159-188 (2016) - [i2]Cédric Bentz, Marie-Christine Costa, Alain Hertz:
On the edge capacitated Steiner tree problem. CoRR abs/1607.07082 (2016) - 2015
- [j109]Jacek Blazewicz, Alain Hertz, Christophe Picouleau, Marino Widmer:
Foreword. Discret. Appl. Math. 182: 1 (2015) - [j108]Claudia Archetti, Nicola Bianchessi, Alain Hertz, Adrien Colombet, François Gagnon:
Directed weighted improper coloring for cellular channel allocation. Discret. Appl. Math. 182: 46-60 (2015) - [i1]Alain Hertz, Vadim V. Lozin, Bernard Ries, Victor Zamaraev, Dominique de Werra:
Dominating induced matchings in graphs containing no long claw. CoRR abs/1505.02558 (2015) - 2014
- [j107]Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz:
Automated generation of conjectures on forbidden subgraph characterization. Discret. Appl. Math. 162: 177-194 (2014) - [j106]Claudia Archetti, Nicola Bianchessi, Alain Hertz:
A branch-and-price algorithm for the robust graph coloring problem. Discret. Appl. Math. 165: 49-59 (2014) - [j105]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz:
The split delivery capacitated team orienteering problem. Networks 63(1): 16-33 (2014) - [j104]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz:
Incomplete service and split deliveries in a routing problem with profits. Networks 63(2): 135-145 (2014) - 2013
- [j103]Pierre Baptiste, Alain Hertz, André Linhares, Djamal Rebaine:
A polynomial time algorithm for unloading boxes off a gravity conveyor. Discret. Optim. 10(4): 251-262 (2013) - 2012
- [j102]Patrick St-Louis, Bernard Gendron, Alain Hertz:
Total domination and the Caccetta-Häggkvist conjecture. Discret. Optim. 9(4): 236-240 (2012) - [j101]Alain Hertz, Marc Uldry, Marino Widmer:
Integer linear programming models for a cement delivery problem. Eur. J. Oper. Res. 222(3): 623-631 (2012) - [j100]Alain Hertz, Odile Marcotte, Asma Mdimagh, Michel Carreau, François Welt:
Optimizing the Design of a Wind Farm Collection Network. INFOR Inf. Syst. Oper. Res. 50(2): 95-104 (2012) - [j99]Claudia Archetti, Luca Bertazzi, Alain Hertz, Maria Grazia Speranza:
A Hybrid Heuristic for an Inventory Routing Problem. INFORMS J. Comput. 24(1): 101-116 (2012) - 2011
- [j98]Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant:
Using local search to speed up filtering algorithms for some NP-hard constraints. Ann. Oper. Res. 184(1): 121-135 (2011) - [j97]Christian Desrosiers, Philippe Galinier, Alain Hertz, Pierre Hansen:
Improving constrained pattern mining with first-fail-based heuristics. Data Min. Knowl. Discov. 23(1): 63-90 (2011) - [j96]Sivan Altinakar, Gilles Caporossi, Alain Hertz:
On compact k-edge-colorings: A polynomial time reduction from linear to cyclic. Discret. Optim. 8(3): 502-512 (2011) - 2010
- [j95]Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza:
The undirected capacitated arc routing problem with profits. Comput. Oper. Res. 37(11): 1860-1869 (2010) - [j94]Alain Hertz, Nadia Lahrichi, Marino Widmer:
A flexible MILP model for multiple-shift workforce planning under annualized hours. Eur. J. Oper. Res. 200(3): 860-873 (2010) - [j93]Alain Hertz, Rina Razanakoto:
Confection de calendriers de matchs pour le sport universitaire et collégial au Québec. INFOR Inf. Syst. Oper. Res. 48(3): 181-189 (2010) - [j92]Mathieu Bouchard, Mirjana Cangalovic, Alain Hertz:
On a reduction of the interval coloring problem to a series of bandwidth coloring problems. J. Sched. 13(6): 583-595 (2010)
2000 – 2009
- 2009
- [j91]Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey:
Corrigendum to "Variable space search for graph coloring" [Discrete Appl. Math. 156 (2008) 2551-2560]. Discret. Appl. Math. 157(7): 1335-1336 (2009) - [j90]Luca Maria Gambardella, Alain Hertz, Frédéric Maffray, Marino Widmer:
Foreword. Discret. Appl. Math. 157(17): 3495-3496 (2009) - [j89]Mathieu Bouchard, Mirjana Cangalovic, Alain Hertz:
About equivalent interval colorings of weighted graphs. Discret. Appl. Math. 157(17): 3615-3624 (2009) - [j88]Alain Hertz, Dominique de Werra:
A Magnetic Procedure for the Stability Number. Graphs Comb. 25(5): 707-716 (2009) - [j87]Alain Hertz, David Schindl, Nicolas Zufferey:
A solution method for a car fleet management problem with maintenance constraints. J. Heuristics 15(5): 425-450 (2009) - [j86]Mathieu Bouchard, Alain Hertz, Guy Desaulniers:
Lower bounds and a tabu search algorithm for the minimum deficiency problem. J. Comb. Optim. 17(2): 168-191 (2009) - [j85]Christian Desrosiers, Philippe Galinier, Alain Hertz, Sandrine Paroz:
Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems. J. Comb. Optim. 18(2): 124-150 (2009) - [j84]Pierre Hansen, Alain Hertz, Rim Kilani, Odile Marcotte, David Schindl:
Average distance and maximum induced forest. J. Graph Theory 60(1): 31-54 (2009) - [j83]Alain Hertz, Nadia Lahrichi:
A patient assignment algorithm for home care services. J. Oper. Res. Soc. 60(4): 481-495 (2009) - [j82]Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza:
The capacitated team orienteering and profitable tour problems. J. Oper. Res. Soc. 60(6): 831-842 (2009) - [j81]Ann-Sophie Pepin, Guy Desaulniers, Alain Hertz, Dennis Huisman:
A comparison of five heuristics for the multiple depot vehicle scheduling problem. J. Sched. 12(1): 17-30 (2009) - 2008
- [j80]Alain Hertz, Sacha Varone:
The Metric Cutpoint Partition Problem. J. Classif. 25(2): 159-175 (2008) - [j79]Christian Desrosiers, Philippe Galinier, Alain Hertz:
Efficient algorithms for finding critical subgraphs. Discret. Appl. Math. 156(2): 244-266 (2008) - [j78]Philippe Galinier, Alain Hertz, Nicolas Zufferey:
An adaptive memory algorithm for the k-coloring problem. Discret. Appl. Math. 156(2): 267-279 (2008) - [j77]Dominique de Werra, Endre Boros, Jacques Carlier, Alain Hertz, Marino Widmer:
Foreword. Discret. Appl. Math. 156(13): 2437-2438 (2008) - [j76]Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey:
Variable space search for graph coloring. Discret. Appl. Math. 156(13): 2551-2560 (2008) - [j75]Bernard Gendron, Alain Hertz, Patrick St-Louis:
A sequential elimination algorithm for computing bounds on the clique number of a graph. Discret. Optim. 5(3): 615-628 (2008) - [j74]Bernard Gendron, Alain Hertz, Patrick St-Louis:
On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem. Oper. Res. Lett. 36(3): 345-350 (2008) - [c4]Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant:
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints. CPAIOR 2008: 298-302 - 2007
- [j73]Alain Hertz, Sacha Varone:
The Metric Bridge Partition Problem: Partitioning of a Metric Space into Two Subspaces Linked by an Edge in Any Optimal Realization. J. Classif. 24(2): 235-249 (2007) - [j72]Michel Gamache, Alain Hertz, Jérôme Olivier Ouellet:
A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding. Comput. Oper. Res. 34(8): 2384-2395 (2007) - [j71]Philippe Galinier, Alain Hertz:
Solution techniques for the Large Set Covering Problem. Discret. Appl. Math. 155(3): 312-326 (2007) - [j70]Claudia Archetti, Alain Hertz, Maria Grazia Speranza:
Metaheuristics for the team orienteering problem. J. Heuristics 13(1): 49-76 (2007) - [j69]Bernard Gendron, Alain Hertz, Patrick St-Louis:
On edge orienting methods for graph coloring. J. Comb. Optim. 13(2): 163-178 (2007) - [j68]Alain Hertz, Sacha Varone:
A note on tree realizations of matrices. RAIRO Oper. Res. 41(4): 361-366 (2007) - [c3]Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz:
Improving Frequent Subgraph Mining in the Presence of Symmetry. MLG 2007 - 2006
- [j67]Alain Hertz:
Anniversary focused issue of Computers & Operations Research on tabu search. Comput. Oper. Res. 33: 2447-2448 (2006) - [j66]Philippe Galinier, Alain Hertz:
A survey of local search methods for graph coloring. Comput. Oper. Res. 33: 2547-2562 (2006) - [j65]Michael U. Gerber, Alain Hertz, Vadim V. Lozin:
Augmenting chains in graphs without a skew star. J. Comb. Theory B 96(3): 352-366 (2006) - [j64]Nadia Lahrichi, Sophie D. Lapierre, Alain Hertz, A. Talib, Lorraine Bouvier:
Analysis of a territorial approach to the delivery of nursing home care services based on historical data. J. Medical Syst. 30(4): 283-291 (2006) - [j63]Claudia Archetti, Maria Grazia Speranza, Alain Hertz:
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Transp. Sci. 40(1): 64-73 (2006) - 2005
- [j62]Alain Hertz, David Schindl, Nicolas Zufferey:
Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints. 4OR 3(2): 139-161 (2005) - 2004
- [j61]Michel Gendreau, Alain Hertz, Frédéric Semet, Marino Widmer:
Preface. Discret. Appl. Math. 145(1): 1-2 (2004) - 2003
- [j60]Tamás Kis, Alain Hertz:
A Lower Bound for the Job Insertion Problem. Discret. Appl. Math. 128(2-3): 395-419 (2003) - [j59]Michael U. Gerber, Alain Hertz, David Schindl:
P5-free augmenting graphs and the maximum stable set problem. Discret. Appl. Math. 132(1-3): 109-119 (2003) - [j58]Michael U. Gerber, Alain Hertz, Vadim V. Lozin:
Stable sets in two subclasses of banner-free graphs. Discret. Appl. Math. 132(1-3): 121-136 (2003) - [j57]Alain Hertz, Marino Widmer:
Guidelines for the use of meta-heuristics in combinatorial optimization. Eur. J. Oper. Res. 151(2): 247-252 (2003) - [j56]Cédric Avanthay, Alain Hertz, Nicolas Zufferey:
A variable neighborhood search for graph coloring. Eur. J. Oper. Res. 151(2): 379-388 (2003) - [j55]Alain Hertz, Vadim V. Lozin, David Schindl:
Finding augmenting chains in extensions of claw-free graphs. Inf. Process. Lett. 86(6): 311-316 (2003) - 2002
- [j54]Michael U. Gerber, Pierre Hansen, Alain Hertz:
Extension of Turán's Theorem to the 2-Stability Number. Graphs Comb. 18(3): 479-489 (2002) - [j53]Marie-Christine Costa, Alain Hertz, Michel Mittaz:
Bounds and Heuristics for the Shortest Capacitated Paths Problem. J. Heuristics 8(4): 449-465 (2002) - [j52]Francine Herrmann, Alain Hertz:
Finding the Chromatic Number by Means of Critical Graphs. ACM J. Exp. Algorithmics 7: 10 (2002) - 2001
- [j51]Michael U. Gerber, Alain Hertz:
A Transformation Which Preserves the Clique Number. J. Comb. Theory B 83(2): 320-330 (2001) - [j50]Alain Hertz, Michel Mittaz:
A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem. Transp. Sci. 35(4): 425-434 (2001) - 2000
- [j49]Dominique de Werra, Alain Hertz, Daniel Kobler, Nadimpalli V. R. Mahadev:
Feasible edge colorings of trees with cardinality constraints. Discret. Math. 222(1-3): 61-72 (2000) - [j48]Francine Herrmann, Alain Hertz:
Finding the chromatic number by means of critical graphs. Electron. Notes Discret. Math. 5: 174-176 (2000) - [j47]Alain Hertz, Daniel Kobler:
A framework for the description of evolutionary algorithms. Eur. J. Oper. Res. 126(1): 1-12 (2000) - [j46]Alain Hertz, Gilbert Laporte, Michel Mittaz:
A Tabu Search Heuristic for the Capacitated Arc Routing Problem. Oper. Res. 48(1): 129-135 (2000) - [j45]Alain Hertz, Vincent Robert, Vincent Berthod:
Planification des Emplois du Temps et de la Formation au Sein d'une Grande Entreprise. RAIRO Oper. Res. 34(1): 61-83 (2000)
1990 – 1999
- 1999
- [j44]Jacques Carlier, Alain Hertz, Frédéric Maffray, Marino Widmer:
Preface. Discret. Appl. Math. 94(1-3): 1 (1999) - [j43]Alain Hertz:
On Perfect Switching Classes. Discret. Appl. Math. 94(1-3): 3-7 (1999) - [j42]Jacek Blazewicz, Alain Hertz, Daniel Kobler, Dominique de Werra:
On some Properties of DNA Graphs. Discret. Appl. Math. 98(1-2): 1-19 (1999) - [j41]Dominique de Werra, Alain Hertz:
On perfectness of sums of graphs. Discret. Math. 195(1-3): 93-101 (1999) - [j40]Patrice Calégari, Giovanni Coray, Alain Hertz, Daniel Kobler, Pierre Kuonen:
A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization. J. Heuristics 5(2): 145-158 (1999) - [j39]Alain Hertz, Gilbert Laporte, Pierrette Nanchen Hugo:
Improvement Procedures for the Undirected Rural Postman Problem. INFORMS J. Comput. 11(1): 53-62 (1999) - [j38]Shoshana Anily, Julien Bramel, Alain Hertz:
A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems. Oper. Res. Lett. 24(1-2): 29-35 (1999) - 1998
- [j37]Alain Hertz:
On Perfect Switching Classes. Discret. Appl. Math. 89(1-3): 263-267 (1998) - [j36]Alain Hertz, Vincent Robert:
Constructing a course schedule by solving a series of assignment type problems. Eur. J. Oper. Res. 108(3): 585-603 (1998) - [j35]Michel Gendreau, Alain Hertz, Gilbert Laporte, Mihnea Stan:
A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows. Oper. Res. 46(3): 330-335 (1998) - 1997
- [j34]Alain Hertz:
On the Use of Boolean Methods for the Computation of the Stability Number. Discret. Appl. Math. 76(1-3): 183-203 (1997) - [j33]Pierre Hansen, Alain Hertz, Nicolas Quinodoz:
Splitting trees. Discret. Math. 165-166: 403-419 (1997) - [j32]Michel Gendreau, Gilbert Laporte, Alain Hertz:
An Approximation Algorithm for the Traveling Salesman Problem with Backhauls. Oper. Res. 45(4): 639-641 (1997) - 1996
- [j31]Michel Gendreau, Alain Hertz, Gilbert Laporte:
The Traveling Salesman Problem with Backhauls. Comput. Oper. Res. 23(5): 501-508 (1996) - [j30]Alain Hertz, Maurice Queyranne, Marino Widmer:
Preface. Discret. Appl. Math. 65(1-3): 1-3 (1996) - [j29]Alain Hertz, Yves Mottet, Yves Rochat:
on a Scheduling Problem in a Robotized Analytical System. Discret. Appl. Math. 65(1-3): 285-318 (1996) - [j28]Alain Hertz, Marino Widmer:
An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints. Discret. Appl. Math. 65(1-3): 319-345 (1996) - [j27]Jacques A. Ferland, Alain Hertz, Alain Lavoie:
An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques. Oper. Res. 44(2): 347-359 (1996) - 1995
- [j26]Alain Hertz:
Polynomially Solvable Cases for the Maximum Stable Set Problem. Discret. Appl. Math. 60(1-3): 195-210 (1995) - [j25]Daniel Costa, Alain Hertz, Clivier Dubuis:
Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs. J. Heuristics 1(1): 105-128 (1995) - [c2]Vincent Robert, Alain Hertz:
How to Decompose Constrained Course Scheduling Problems into Easier Assignment Type Subproblems. PATAT 1995: 364-373 - 1994
- [j24]Alain Hertz, Brigitte Jaumard, Marcus Poggi de Aragão:
Local Optima Topology for the k-Coloring Problem. Discret. Appl. Math. 49(1-3): 257-280 (1994) - [j23]Alain Hertz, Brigitte Jaumard, Celso C. Ribeiro:
A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing. Discret. Appl. Math. 50(3): 255-265 (1994) - [j22]Alain Hertz:
A New Polynomial-Time Algorithm for the Maximum Weighted (\chi(G) - 1)-Coloring Problem in Comparability Graphs. Math. Syst. Theory 27(4): 357-363 (1994) - 1993
- [j21]Pierre Hansen, Alain Hertz, Julio Kuplinsky:
Bounded vertex colorings of graphs. Discret. Math. 111(1-3): 305-312 (1993) - [j20]Alain Hertz:
Most unbreakable murky graphs are bull-free. Graphs Comb. 9(2-4): 173-175 (1993) - [j19]Alain Hertz, Dominique de Werra:
On the stability number of AH-free graphs. J. Graph Theory 17(1): 53-63 (1993) - 1992
- [j18]Dominique de Werra, Alain Hertz:
Foreword. Discret. Appl. Math. 35(3): 175-176 (1992) - [j17]Alain Hertz:
Finding a feasible course schedule using Tabu search. Discret. Appl. Math. 35(3): 255-270 (1992) - [j16]Michel Gendreau, Alain Hertz, Gilbert Laporte:
New Insertion and Postoptimization Procedures for the Traveling Salesman Problem. Oper. Res. 40(6): 1086-1094 (1992) - 1991
- [j15]Alain Hertz:
Cosine: A new graph coloring algorithm. Oper. Res. Lett. 10(7): 411-415 (1991) - 1990
- [j14]Alain Hertz, Dominique de Werra:
The Tabu Search Metaheuristic: How we used it. Ann. Math. Artif. Intell. 1: 111-121 (1990) - [j13]Charles Friden, Alain Hertz, Dominique de Werra:
Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph. Comput. Oper. Res. 17(5): 437-445 (1990) - [j12]Alain Hertz:
Bipolarizable graphs. Discret. Math. 81(1): 25-32 (1990) - [j11]Alain Hertz:
A fast algorithm for coloring Meyniel graphs. J. Comb. Theory B 50(2): 231-240 (1990) - [c1]Patrick Brézillon, Dong-Yih Bau, Alain Hertz, A. P. Fauquembergue Maizener:
Elaboration of the SEPT Expert System as the Coupling of a Simulator and a Diagnostician. IEA/AIE (Vol. 1) 1990: 54-60
1980 – 1989
- 1989
- [j10]Charles Friden, Alain Hertz, Dominique de Werra:
STABULUS: A technique for finding stable sets in large graphs with tabu search. Computing 42(1): 35-44 (1989) - [j9]Alain Hertz, Dominique de Werra:
Foreword. Discret. Math. 74(1-2): 1-2 (1989) - [j8]Alain Hertz, Dominique de Werra:
Connected sequential colorings. Discret. Math. 74(1-2): 51-59 (1989) - [j7]Alain Hertz:
Skeletal graphs - a new class of perfect graphs. Discret. Math. 78(3): 291-296 (1989) - [j6]Alain Hertz:
Slim graphs. Graphs Comb. 5(1): 149-157 (1989) - 1988
- [j5]Alain Hertz, Dominique de Werra:
Perfectly orderable graphs are quasi-parity graphs: a short proof. Discret. Math. 68(1): 111-113 (1988) - [j4]Alain Hertz:
Bipartable graphs. J. Comb. Theory B 45(1): 1-12 (1988) - [j3]Dominique de Werra, Alain Hertz:
Consecutive colorings of graphs. ZOR Methods Model. Oper. Res. 32(1): 1-8 (1988) - 1987
- [j2]Alain Hertz, Dominique de Werra:
Using tabu search techniques for graph coloring. Computing 39(4): 345-351 (1987) - 1986
- [j1]Alain Hertz:
Quelques utilisations de la struction. Discret. Math. 59(1-2): 79-89 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
