☰

Alain Hertz - Publications

Affiliations: 
Ecole Polytechnique, Montreal (Canada) 
Area:
Mathematics
Tree Info Similar researchers PubMed Report error

125 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Bentz C, Costa M, Hertz A. On the edge capacitated Steiner tree problem Discrete Optimization. 38: 100607. DOI: 10.1016/J.Disopt.2020.100607  0.408
2020 Bürgy R, Hertz A, Baptiste P. An exact dynamic programming algorithm for the precedence-constrained class sequencing problem Computers & Operations Research. 124: 105063. DOI: 10.1016/J.Cor.2020.105063  0.438
2020 Hertz A. An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes Optimization Letters. 14: 355-367. DOI: 10.1007/S11590-017-1184-Z  0.454
2020 Hertz A, Ridremont T. A tabu search for the design of capacitated rooted survivable planar networks Journal of Heuristics. 1-22. DOI: 10.1007/S10732-020-09453-X  0.459
2019 Devillez G, Hertz A, Mélot H, Hauweele P. Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pendant Vertices Yugoslav Journal of Operations Research. 29: 193-202. DOI: 10.2298/Yjor181115010D  0.385
2019 Hauweele P, Hertz A, Mélot H, Ries B, Devillez G. Maximum eccentric connectivity index for graphs with given diameter Discrete Applied Mathematics. 268: 102-111. DOI: 10.1016/J.Dam.2019.04.031  0.392
2019 Hertz A, Montagné R, Gagnon F. A comparison of integer programming models for the partial directed weighted improper coloring problem Discrete Applied Mathematics. 261: 229-245. DOI: 10.1016/J.Dam.2018.08.026  0.479
2018 Absil R, Camby E, Hertz A, Mélot H. 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. DOI: 10.1016/J.Dam.2016.06.025  0.395
2018 Hertz A, Montagné R, Gagnon F. Online algorithms for the maximum k-colorable subgraph problem Computers & Operations Research. 91: 209-224. DOI: 10.1016/J.Cor.2017.10.003  0.437
2018 Bürgy R, Baptiste P, Hertz A, Rebaine D, Linhares A. A stochastic online algorithm for unloading boxes from a conveyor line Flexible Services and Manufacturing Journal. 30: 764-784. DOI: 10.1007/S10696-017-9291-9  0.426
2018 Hertz A, Lozin VV, Ries B, Zamaraev V, Werra Dd. Dominating induced matchings in graphs containing no long claw Journal of Graph Theory. 88: 18-39. DOI: 10.1002/Jgt.22182  0.47
2017 Altinakar S, Caporossi G, Hertz A. Symmetry Breaking Constraints for the Minimum Deficiency Problem Journal of Graph Algorithms and Applications. 21: 195-218. DOI: 10.7155/Jgaa.00412  0.451
2017 Rybarczyk A, Hertz A, Kasprzak M, Blazewicz J. Tabu search for the RNA partial degradation problem International Journal of Applied Mathematics and Computer Science. 27: 401-415. DOI: 10.1515/Amcs-2017-0028  0.343
2017 Baptiste P, Bürgy R, Hertz A, Rebaine D. Online heuristics for unloading boxes off a gravity conveyor International Journal of Production Research. 55: 3046-3057. DOI: 10.1080/00207543.2016.1229073  0.398
2017 Hertz A, Marcotte O, Mdimagh A, Carreau M, Welt F. Design of a wind farm collection network when several cable types are available Journal of the Operational Research Society. 68: 62-73. DOI: 10.1057/S41274-016-0021-6  0.447
2017 Montagné R, Hertz A, Gagnon F. A multi-cell graph based dynamic resource allocation scheme for multi-user wireless networks Aeu - International Journal of Electronics and Communications. 76: 60-70. DOI: 10.1016/J.Aeue.2017.03.015  0.402
2016 Hertz A, Montagné R, Gagnon F. Constructive algorithms for the partial directed weighted improper coloring problem Journal of Graph Algorithms and Applications. 20: 159-188. DOI: 10.7155/Jgaa.00389  0.478
2016 Adegbindin M, Hertz A, Bellaïche M. A New Efficient Rlf-Like Algorithm For The Vertex Coloring Problem Yugoslav Journal of Operations Research. 26: 441-456. DOI: 10.2298/Yjor151102003A  0.448
2016 Hertz A, Mélot H. Counting the number of non-equivalent vertex colorings of a graph Discrete Applied Mathematics. 203: 62-71. DOI: 10.1016/J.Dam.2015.09.015  0.391
2016 Altinakar S, Caporossi G, Hertz A. A comparison of integer and constraint programming models for the deficiency problem Computers and Operations Research. 68: 89-96. DOI: 10.1016/J.Cor.2015.10.016  0.476
2015 de Werra D, Hertz A. Chromatic scheduling Topics in Chromatic Graph Theory. 255-276. DOI: 10.1017/CBO9781139519793.015  0.378
2015 Archetti C, Bianchessi N, Hertz A, Colombet A, Gagnon F. Directed weighted improper coloring for cellular channel allocation Discrete Applied Mathematics. 182: 46-60. DOI: 10.1016/J.Dam.2013.11.018  0.46
2014 Desrosiers C, Galinier P, Hansen P, Hertz A. Automated generation of conjectures on forbidden subgraph characterization Discrete Applied Mathematics. 162: 177-194. DOI: 10.1016/J.Dam.2013.07.013  0.401
2014 Archetti C, Bianchessi N, Hertz A. A branch-and-price algorithm for the robust graph coloring problem Discrete Applied Mathematics. 165: 49-59. DOI: 10.1016/J.Dam.2013.02.013  0.51
2014 Archetti C, Bianchessi N, Speranza MG, Hertz A. Incomplete service and split deliveries in a routing problem with profits Networks. 63: 135-145. DOI: 10.1002/Net.21529  0.406
2014 Archetti C, Bianchessi N, Speranza MG, Hertz A. The split delivery capacitated team orienteering problem Networks. 63: 16-33. DOI: 10.1002/Net.21519  0.425
2013 Baptiste P, Hertz A, Linhares A, Rebaine D. A polynomial time algorithm for unloading boxes off a gravity conveyor Discrete Optimization. 10: 251-262. DOI: 10.1016/J.Disopt.2013.07.004  0.403
2012 Hertz A, Marcotte O, Mdimagh A, Carreau M, Welt F. Optimizing the design of a wind farm collection network Infor. 50: 95-104. DOI: 10.3138/Infor.50.2.095  0.637
2012 Archetti C, Bertazzi L, Hertz A, Speranza MG. A Hybrid Heuristic for an Inventory Routing Problem Informs Journal On Computing. 24: 101-116. DOI: 10.1287/Ijoc.1100.0439  0.39
2012 Hertz A, Uldry M, Widmer M. Integer linear programming models for a cement delivery problem European Journal of Operational Research. 222: 623-631. DOI: 10.1016/J.Ejor.2012.04.039  0.411
2012 St-Louis P, Gendron B, Hertz A. Total domination and the Caccetta-Häggkvist conjecture Discrete Optimization. 9: 236-240. DOI: 10.1016/J.Disopt.2012.07.004  0.317
2011 Altinakar S, Caporossi G, Hertz A. On compact k-edge-colorings: A polynomial time reduction from linear to cyclic Discrete Optimization. 8: 502-512. DOI: 10.1016/J.Disopt.2011.04.004  0.353
2011 Galinier P, Hertz A, Paroz S, Pesant G. Using local search to speed up filtering algorithms for some NP-hard constraints Annals of Operations Research. 184: 121-135. DOI: 10.1007/S10479-010-0715-0  0.34
2010 Hertz A, Lahrichi N, Widmer M. A flexible MILP model for multiple-shift workforce planning under annualized hours European Journal of Operational Research. 200: 860-873. DOI: 10.1016/J.Ejor.2009.01.045  0.361
2010 Archetti C, Feillet D, Hertz A, Speranza MG. The undirected capacitated arc routing problem with profits Computers & Operations Research. 37: 1860-1869. DOI: 10.1016/J.Cor.2009.05.005  0.516
2010 Bouchard M, Čangalović M, Hertz A. On a reduction of the interval coloring problem to a series of bandwidth coloring problems Journal of Scheduling. 13: 583-595. DOI: 10.1007/S10951-009-0149-1  0.483
2010 Desrosiers C, Galinier P, Hertz A, Hansen P. Improving constrained pattern mining with first-fail-based heuristics Data Mining and Knowledge Discovery. 23: 63-90. DOI: 10.1007/S10618-010-0199-1  0.345
2010 Hertz A, de Werra D. A magnetic procedure for the stability number Graphs and Combinatorics. 25: 707-716. DOI: 10.1007/S00373-010-0886-0  0.358
2010 Widmer M, Hertz A, Costa D. Metaheuristics and Scheduling Production Scheduling. 33-68. DOI: 10.1002/9780470611050.ch3  0.321
2009 Archetti C, Feillet D, Hertz A, Speranza MG. The capacitated team orienteering and profitable tour problems Journal of the Operational Research Society. 60: 831-842. DOI: 10.1057/Palgrave.Jors.2602603  0.437
2009 Hertz A, Lahrichi N. A patient assignment algorithm for home care services Journal of the Operational Research Society. 60: 481-495. DOI: 10.1057/Palgrave.Jors.2602574  0.32
2009 Bouchard M, angalović M, Hertz A. About equivalent interval colorings of weighted graphs Discrete Applied Mathematics. 157: 3615-3624. DOI: 10.1016/J.Dam.2009.04.015  0.394
2009 Hertz A, Plumettaz M, Zufferey N. Corrigendum to "Variable space search for graph coloring" [Discrete Appl. Math. 156 (2008) 2551-2560] Discrete Applied Mathematics. 157: 1335-1336. DOI: 10.1016/J.Dam.2008.11.008  0.362
2009 Pepin AS, Desaulniers G, Hertz A, Huisman D. A comparison of five heuristics for the multiple depot vehicle scheduling problem Journal of Scheduling. 12: 17-30. DOI: 10.1007/S10951-008-0072-X  0.431
2009 Desrosiers C, Galinier P, Hertz A, Paroz S. Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems Journal of Combinatorial Optimization. 18: 124-150. DOI: 10.1007/S10878-008-9142-4  0.375
2009 Bouchard M, Hertz A, Desaulniers G. Lower bounds and a tabu search algorithm for the minimum deficiency problem Journal of Combinatorial Optimization. 17: 168-191. DOI: 10.1007/S10878-007-9106-0  0.413
2009 Hertz A, Schindl D, Zufferey N. A solution method for a car fleet management problem with maintenance constraints Journal of Heuristics. 15: 425-450. DOI: 10.1007/S10732-008-9072-4  0.499
2009 Hansen P, Hertz A, Kilani R, Marcotte O, Schindl D. Average distance and maximum induced forest Journal of Graph Theory. 60: 31-54. DOI: 10.1002/Jgt.V60:1  0.375
2008 Gendron B, Hertz A, St-Louis P. On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem Operations Research Letters. 36: 345-350. DOI: 10.1016/J.Orl.2007.09.004  0.483
2008 Gendron B, Hertz A, St-Louis P. A sequential elimination algorithm for computing bounds on the clique number of a graph Discrete Optimization. 5: 615-628. DOI: 10.1016/J.Disopt.2008.01.001  0.443
2008 Hertz A, Plumettaz M, Zufferey N. Variable space search for graph coloring Discrete Applied Mathematics. 156: 2551-2560. DOI: 10.1016/J.Dam.2008.03.022  0.456
2008 Desrosiers C, Galinier P, Hertz A. Efficient algorithms for finding critical subgraphs Discrete Applied Mathematics. 156: 244-266. DOI: 10.1016/J.Dam.2006.07.019  0.435
2008 Galinier P, Hertz A, Zufferey N. An adaptive memory algorithm for the k-coloring problem Discrete Applied Mathematics. 156: 267-279. DOI: 10.1016/J.Dam.2006.07.017  0.408
2008 Hertz A, Varone S. The metric cutpoint partition problem Journal of Classification. 25: 159-175. DOI: 10.1007/S00357-008-9016-6  0.415
2007 Galinier P, Hertz A. Solution techniques for the Large Set Covering Problem Discrete Applied Mathematics. 155: 312-326. DOI: 10.1016/J.Dam.2006.04.043  0.442
2007 Gamache M, Hertz A, Ouellet JO. A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding Computers & Operations Research. 34: 2384-2395. DOI: 10.1016/J.Cor.2005.09.010  0.526
2007 Gendron B, Hertz A, St-Louis P. On edge orienting methods for graph coloring Journal of Combinatorial Optimization. 13: 163-178. DOI: 10.1007/S10878-006-9019-3  0.479
2007 Archetti C, Hertz A, Speranza MG. Metaheuristics for the team orienteering problem Journal of Heuristics. 13: 49-76. DOI: 10.1007/S10732-006-9004-0  0.469
2007 Hertz A, Varone S. 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: 235-249. DOI: 10.1007/S00357-007-0011-0  0.356
2006 Archetti C, Speranza MG, Hertz A. A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem Transportation Science. 40: 64-73. DOI: 10.1287/Trsc.1040.0103  0.445
2006 Gerber MU, Hertz A, Lozin VV. Augmenting chains in graphs without a skew star Journal of Combinatorial Theory. Series B. 96: 352-366. DOI: 10.1016/J.Jctb.2005.09.007  0.479
2006 Galinier P, Hertz A. A survey of local search methods for graph coloring Computers and Operations Research. 33: 2547-2562. DOI: 10.1016/J.Cor.2005.07.028  0.432
2005 Hertz A, Schindl D, Zufferey N. Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints A Quarterly Journal of Operations Research. 3: 139-161. DOI: 10.1007/S10288-004-0057-3  0.436
2005 Avis D, Hertz A, Marcotte O. Graph theory and combinatorial optimization Graph Theory and Combinatorial Optimization. 1-264. DOI: 10.1007/b135661  0.341
2005 Hertz A, Lozin VV. The maximum independent set problem and augmenting graphs Graph Theory and Combinatorial Optimization. 69-99. DOI: 10.1007/0-387-25592-3_4  0.432
2005 Hertz A. Recent trends in arc routing Operations Research/ Computer Science Interfaces Series. 34: 215-236.  0.332
2003 Avanthay C, Hertz A, Zufferey N. A variable neighborhood search for graph coloring European Journal of Operational Research. 151: 379-388. DOI: 10.1016/S0377-2217(02)00832-9  0.458
2003 Hertz A, Widmer M. Guidelines for the use of meta-heuristics in combinatorial optimization European Journal of Operational Research. 151: 247-252. DOI: 10.1016/S0377-2217(02)00823-8  0.441
2003 Gerber MU, Hertz A, Lozin VV. Stable sets in two subclasses of banner-free graphs Discrete Applied Mathematics. 132: 121-136. DOI: 10.1016/S0166-218X(03)00395-0  0.471
2003 Gerber MU, Hertz A, Schindl D. P 5 -free augmenting graphs and the maximum stable set problem Discrete Applied Mathematics. 132: 109-119. DOI: 10.1016/S0166-218X(03)00394-9  0.451
2003 Kis T, Hertz A. A lower bound for the job insertion problem Discrete Applied Mathematics. 128: 395-419. DOI: 10.1016/S0166-218X(02)00502-4  0.468
2003 Hertz A, Lozin V, Schindl D. Finding augmenting chains in extensions of claw-free graphs Information Processing Letters. 86: 311-316. DOI: 10.1016/S0020-0190(03)00223-0  0.467
2002 Costa MC, Hertz A, Mittaz M. Bounds and heuristics for the shortest capacitated paths problem Journal of Heuristics. 8: 449-465. DOI: 10.1023/A:1015492014030  0.516
2002 Gerber MU, Hansen P, Hertz A. Extension of Turán's Theorem to the 2-Stability Number Graphs and Combinatorics. 18: 479-489. DOI: 10.1007/S003730200034  0.356
2001 Hertz A, Mittaz M. A variable neighborhood descent algorithm for the undirected capacitated arc routing problem Transportation Science. 35: 425-434. DOI: 10.1287/Trsc.35.4.425.10431  0.427
2001 Gerber MU, Hertz A. A transformation which preserves the clique number Journal of Combinatorial Theory. Series B. 83: 320-330. DOI: 10.1006/Jctb.2001.2061  0.4
2000 Hertz A, Laporte G, Mittaz M. A Tabu Search Heuristic for the Capacitated Arc Routing Problem Operations Research. 48: 129-135. DOI: 10.1287/Opre.48.1.129.12455  0.474
2000 Herrmann F, Hertz A. Finding the chromatic number by means of critical graphs Electronic Notes in Discrete Mathematics. 5: 1-3. DOI: 10.1145/944618.944628  0.488
2000 Hertz A, Kobler D. Framework for the description of evolutionary algorithms European Journal of Operational Research. 126: 1-12. DOI: 10.1016/S0377-2217(99)00435-X  0.305
2000 Werra Dd, Hertz A, Kobler D, Mahadev NVR. Feasible edge colorings of trees with cardinality constraints Discrete Mathematics. 222: 61-72. DOI: 10.1016/S0012-365X(00)00006-6  0.428
1999 Hertz A, Laporte G, Hugo PN. Improvement Procedures for the Undirected Rural Postman Problem Informs Journal On Computing. 11: 53-62. DOI: 10.1287/Ijoc.11.1.53  0.425
1999 Calégari P, Coray G, Hertz A, Kobler D, Kuonen P. A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization Journal of Heuristics. 5: 145-158. DOI: 10.1023/A:1009625526657  0.318
1999 Anily S, Bramel J, Hertz A. A 53-approximation algorithm for the clustered traveling salesman tour and path problems Operations Research Letters. 24: 29-35. DOI: 10.1016/S0167-6377(98)00046-7  0.425
1999 Blazewicz J, Hertz A, Kobler D, Werra Dd. On some properties of DNA graphs Discrete Applied Mathematics. 98: 1-19. DOI: 10.1016/S0166-218X(99)00109-2  0.443
1999 Hertz A. On perfect switching classes Discrete Applied Mathematics. 94: 3-7. DOI: 10.1016/S0166-218X(98)00134-6  0.37
1999 De Werra D, Hertz A. On perfectness of sums of graphs Discrete Mathematics. 195: 93-101. DOI: 10.1016/S0012-365X(98)00168-X  0.35
1998 Gendreau M, Hertz A, Laporte G, Stan M. A generalized insertion heuristic for the traveling salesman problem with time windows Operations Research. 46: 330-346. DOI: 10.1287/Opre.46.3.330  0.446
1998 Hertz A, Laporte G, Mittaz M, Stecke KE. Heuristics for minimizing tool switches when scheduling part types on a flexible machine Iie Transactions. 30: 689-694. DOI: 10.1080/07408179808966514  0.354
1998 Hertz A, Robert V. Constructing a course schedule by solving a series of assignment type problems European Journal of Operational Research. 108: 585-603. DOI: 10.1016/S0377-2217(97)00097-0  0.462
1997 Gendreau M, Laporte G, Hertz A. An approximation algorithm for the Traveling Salesman Problem with Backhauls Operations Research. 45: 639-641. DOI: 10.1287/Opre.45.4.639  0.441
1997 Costa D, Hertz A. Ants can colour graphs Journal of the Operational Research Society. 48: 295-305. DOI: 10.1057/Palgrave.Jors.2600357  0.514
1997 Widmer M, Bugnon B, Varone S, Hertz A. Rhythmed Flow Shop : How to Balance the Daily Workload Ifac Proceedings Volumes. 30: 245-248. DOI: 10.1016/S1474-6670(17)42306-8  0.394
1997 Hertz A. On the use of Boolean methods for the computation of the stability number Discrete Applied Mathematics. 76: 183-203. DOI: 10.1016/S0166-218X(96)00124-2  0.384
1996 Gendreau M, Hertz A, Laporte G. The Traveling Salesman Problem with Backhauls Computers and Operations Research. 23: 501-508. DOI: 10.1016/0305-0548(95)00036-4  0.469
1996 Hertz A, Widmer M. An improved tabu search approach for solving the job shop scheduling problem with tooling constraints Discrete Applied Mathematics. 65: 319-345. DOI: 10.1016/0166-218X(95)00040-X  0.426
1996 Hertz A, Mottet Y, Rochat Y. On a scheduling problem in a robotized analytical system Discrete Applied Mathematics. 65: 285-318. DOI: 10.1016/0166-218X(95)00039-T  0.327
1996 Robert V, Hertz A. How to decompose constrained course scheduling problems into easier assignment type subproblems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1153: 364-373. DOI: 10.1007/3-540-61794-9_71  0.353
1995 Hertz A. Polynomially solvable cases for the maximum stable set problem Discrete Applied Mathematics. 60: 195-210. DOI: 10.1016/0166-218X(94)00051-E  0.333
1995 Costa D, Hertz A, Dubuis C. Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs Journal of Heuristics. 1: 105-128. DOI: 10.1007/Bf02430368  0.528
1994 Gendreau M, Hertz A, Laporte G. A tabu search heuristic for the vehicle routing problem Management Science. 40: 1276-1290. DOI: 10.1287/Mnsc.40.10.1276  0.46
1994 Hertz A, Jaumard B, Ribeiro CC, Filho WPF. A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives Rairo-Operations Research. 28: 303-328. DOI: 10.1051/Ro/1994280303031  0.406
1994 Gendreau M, Hertz A, Laporte G. A generalized insertion algorithm for the seriation problem Mathematical and Computer Modelling. 19: 53-59. DOI: 10.1016/0895-7177(94)90040-X  0.487
1994 Hertz A, Jaumard B, Poggi de Aragão M. Local optima topology for the k-coloring problem Discrete Applied Mathematics. 49: 257-280. DOI: 10.1016/0166-218X(94)90212-7  0.4
1994 Hertz A, Jaumard B, Ribeiro CC. A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing Discrete Applied Mathematics. 50: 255-265. DOI: 10.1016/0166-218X(92)00173-J  0.463
1994 Hertz A. A new polynomial-time algorithm for the maximum weighted (χ(G) - 1)-coloring problem in comparability graphs Mathematical Systems Theory. 27: 357-363. DOI: 10.1007/BF01192145  0.425
1993 Hansen P, Hertz A, Kuplinsky J. Bounded vertex colorings of graphs Discrete Mathematics. 111: 305-312. DOI: 10.1016/0012-365X(93)90165-P  0.411
1993 Hertz A. Most unbreakable murky graphs are bull-free Graphs and Combinatorics. 9: 173-175. DOI: 10.1007/Bf02988303  0.365
1993 Hertz A, Werra Dd. On the stability number of AH-free graphs Journal of Graph Theory. 17: 53-63. DOI: 10.1002/Jgt.3190170107  0.4
1992 Gendreau M, Hertz A, Laporte G. New insertion and postoptimization procedures for the traveling salesman problem Operations Research. 40: 1086-1094. DOI: 10.1287/Opre.40.6.1086  0.42
1992 Hertz A. Finding a feasible course schedule using Tabu search Discrete Applied Mathematics. 35: 255-270. DOI: 10.1016/0166-218X(92)90248-9  0.385
1991 Hertz A. Tabu search for large scale timetabling problems European Journal of Operational Research. 54: 39-47. DOI: 10.1016/0377-2217(91)90321-L  0.318
1991 Hertz A. Cosine: A new graph coloring algorithm Operations Research Letters. 10: 411-415. DOI: 10.1016/0167-6377(91)90043-O  0.453
1990 Friden C, Hertz A, de Werra D. Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph Computers and Operations Research. 17: 437-445. DOI: 10.1016/0305-0548(90)90048-C  0.434
1990 Hertz A. A fast algorithm for coloring Meyniel graphs Journal of Combinatorial Theory, Series B. 50: 231-240. DOI: 10.1016/0095-8956(90)90078-E  0.426
1990 Hertz A, de Werra D. The tabu search metaheuristic: How we used it Annals of Mathematics and Artificial Intelligence. 1: 111-121. DOI: 10.1007/Bf01531073  0.418
1989 Widmer M, Hertz A. A new heuristic method for the flow shop sequencing problem European Journal of Operational Research. 41: 186-193. DOI: 10.1016/0377-2217(89)90383-4  0.413
1989 Hertz A, de Werra D. Connected sequential colorings Discrete Mathematics. 74: 51-59. DOI: 10.1016/0012-365X(89)90197-0  0.387
1989 Hertz A. Skeletal graphs - a new class of perfect graphs Discrete Mathematics. 78: 291-296. DOI: 10.1016/0012-365X(89)90184-2  0.399
1989 Friden C, Hertz A, de Werra D. STABULUS: A technique for finding stable sets in large graphs with tabu search Computing. 42: 35-44. DOI: 10.1007/Bf02243141  0.457
1989 de Werra D, Hertz A. Tabu search techniques - A tutorial and an application to neural networks Or Spektrum. 11: 131-141. DOI: 10.1007/Bf01720782  0.399
1988 Hertz A. Bipartable graphs Journal of Combinatorial Theory, Series B. 45: 1-12. DOI: 10.1016/0095-8956(88)90050-0  0.307
1988 Hertz A, de Werra D. Perfectly orderable graphs are quasi-parity graphs: a short proof Discrete Mathematics. 68: 111-113. DOI: 10.1016/0012-365X(88)90047-7  0.382
1987 Chams M, Hertz A, de Werra D. Some experiments with simulated annealing for coloring graphs European Journal of Operational Research. 32: 260-266. DOI: 10.1016/S0377-2217(87)80148-0  0.43
1987 Hertz A, de Werra D. Using tabu search techniques for graph coloring Computing. 39: 345-351. DOI: 10.1007/Bf02239976  0.437
1986 Hertz A. Quelques utilisations de la struction Discrete Mathematics. 59: 79-89. DOI: 10.1016/0012-365X(86)90071-3  0.327
Show low-probability matches.