Groupe d’études et de recherche en analyse des décisions

Publications

Alain Hertz

Articles

Mixed integer programming and extremal chemical graphs
, , , et
International Journal of Chemistry and Chemical Engineering Systems , 3, 22–30, 2018 référence BibTeX
Edge realizability of connected simple graphs
, , , , et
MATCH Communications in Mathematical and in Computer Chemistry, 78(3), 689–712, 2017 référence BibTeX
A hybrid heuristic for an inventory-routing problem
, , et
INFORMS Journal on Computing, 24(1), 101–116, 2012 référence BibTeX
Integer linear programming models for a cement delivery problem
, et
European Journal of Operational Research, 222(3), 623–631, 2012 référence BibTeX
L'enseignement de la théorie des graphes à l’aide d’intrigues policières
Bulletin de l’APMEP, 499, 290–296, 2012 référence BibTeX
Optimizing the design of a wind farm collection network
, , , et
INFOR, 50(2), 95–104, 2012 référence BibTeX
Total domination and the Caccetta-Häggkvist conjecture
, et
Discrete Optimization, 9(4), 236–240, 2012 référence BibTeX
Improving constrained pattern mining with first-fail-based heuristics
, , et
Data Mining and Knowledge Discovery, 23(1), 63–90, 2011 référence BibTeX
On compact \(k\)-edge-colorings: A polynomial time reduction from linear to cyclic
, et
Discrete Optimization, 8(3), 502–512, 2011 référence BibTeX
Using local search to speed up filtering algorithms for some NP-Hard constraints
, , et
Annals of Operations Research, 184(1), 121–135, 2011 référence BibTeX
A flexible MILP model for multiple-shift workforce planning under annualized hours
, et
European Journal of Operational Research, 200, 860–873, 2010 référence BibTeX
Confection de calendriers de matchs pour le sport universitaire et collégial au Québec
et
INFOR, 48, 181–189, 2010 référence BibTeX
On a reduction of the interval coloring problem to a series of bandwidth coloring problems
, et
Journal of Scheduling, 13, 583–595, 2010 référence BibTeX
The undirected capacitated arc routing problem with profits
, , et
Computers & Operations Research, 37, 1860–1869, 2010 référence BibTeX
About Equivalent Interval Colorings of Weighted Graphs
, et
Discrete Applied Mathematics, 157(17), 3615–3624, 2009 référence BibTeX
The capacitated team orienteering and profitable tour problems
, , et
Journal of the Operational Research Society, 60, 831–842, 2009 référence BibTeX
Comparison of heuristic approaches for the multiple depot vehicle scheduling problem
, , et
Journal of Scheduling, 12(1), 17–30, 2009 référence BibTeX
Using meta-heuristics to find minimal unsatisfiable subformulas in satisfiability problems
, , et
Journal of Combinatorial Optimization, 18, 124–150, 2009 référence BibTeX
A solution method for a car fleet management problem with maintenance constraints
, et
Journal of Heuristics, 15(5), 425–450, 2009 référence BibTeX
A magnetic procedure for the stability number
et
Graphs and Combinatorics, 25, 707–716, 2009 référence BibTeX
Client assignment algorithms for home care services
et
Journal of the Operational Research Society, 60(4), 481–495, 2009 référence BibTeX
Corrigendum to "Variable space search for graph coloring"
, et
Discrete Applied Mathematics, 157(7), 1335–1336, 2009 référence BibTeX
Foreward
, , et
Discrete Applied Mathematics, 157(17), 3495–3496, 2009 référence BibTeX
Lower bounds and a Tabu search algorithm for the minimum deficiency problem
, et
Journal of Combinatorial Optimization, 17(2), 168–191, 2009 référence BibTeX
The metric cutpoint partition problem
et
Journal of Classification, 25(2), 159–175, 2008 référence BibTeX
Variable space search for graph coloring
, et
Discrete Applied Mathematics, 156(13), 2551–2560, 2008 référence BibTeX
A sequential elimination algorithm for computing bounds on the clique number of a graph
, et
Discrete Optimization, 615–628, 2008 référence BibTeX
An adaptive memory algorithm for the k-colouring problem
, et
Discrete Applied Mathematics, 156, 267–279, 2008 référence BibTeX
Efficient algorithms for finding critical subgraphs
, et
Discrete Applied Mathematics, 156(2), 244–266, 2008 référence BibTeX
On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem
, et
Operations Research Letters, 36, 345–350, 2008 référence BibTeX
On edge orienting methods for graph coloring
, et
Journal of Combinatorial Optimization, 13(2), 163–178, 2007 référence BibTeX
A graph coloring model for a feasibility problem in crew scheduling
, et
Computers & Operations Research, 34(8), 2384–2395, 2007 référence BibTeX
A note on tree realizations of matrices
et
RAIRO-Operations Research, 41(4), 361–366, 2007 référence BibTeX
Solutions techniques for the large set covering problem 
et
Discrete Applied Mathematics, 155(3), 312–326, 2007 référence BibTeX
The metric bridge partition problem: Partitioning of a metric space into two subspaces linked by an edge in any optimal realization
et
Journal of Classification, 24(2), 235–249, 2007 référence BibTeX
Augmenting chains in graphs without a skew star
, et
Journal of Combinatorial Theory, 96(3), 352–366, 2006 référence BibTeX
A Tabu search algorithm for the split delivery vehicle routing problem
, et
Transportation Science, 40(1), 64–73, 2006 référence BibTeX
A survey of local search methods for graph coloring
et
Computers & Operations Research, 33(9), 2547–2562, 2006 référence BibTeX
Analysis of a territorial approach to the delivery of nursing home care services based on historical data
, , , et
Journal of Medical Systems, 30(4), 283–291, 2006 référence BibTeX
Editorial: Anniversary focused issue of Computers & Operations Research on Tabu search
et
Computers & Operations Research, 33(9), 2447–2448, 2006 référence BibTeX
Lower bounding and Tabu search procedures for the frequency assignment problem with polarization constraints
, et
4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies , 139–161, 2005 référence BibTeX
Finding augmenting chains in extensions of claw-free graphs
, et
Information Processing Letters, 86(6), 311–316, 2003 référence BibTeX
Guidelines for the use of meta-heuristics in combinatorial optimization
et
European Journal of Operational Research, 151, 248–252, 2003 référence BibTeX
A lower-bound for the job insertion problem
et
Discrete Applied Mathematics, 128(38386), 395–419, 2003 référence BibTeX
A variable neighborhood search for graph coloring
, et
European Journal of Operational Research, 151, 379–388, 2003 référence BibTeX
P-5-free augmenting graphs and the maximum stable set problem
, et
Discrete Applied Mathematics, 132(38355), 109–119, 2003 référence BibTeX
Stable sets in 2 subclasses of banner-free graphs
, et
Discrete Applied Mathematics, 132(38355), 121–136, 2003 référence BibTeX

Livres

La Fraternité du Verseau : Une nouvelle enquête de l'Agrapheur
Eaux Troubles, 292 pages, 2020 référence BibTeX
GRAPHITI - L’Inspecteur Manori enquête à Paris
Les Éditions Amalthée, Nantes, France, 334 pages, 2014 référence BibTeX
Sixth international conference on graphs and optimization 2007
, , et
157(17), 2009 référence BibTeX
Anniversary focused issue of Computers & Operations Research on Tabu search, computers & operations research
et
33(9), Elsevier, 327 pages, 2006 référence BibTeX

Chapitres de livre

Graph colouring variations
et
À paraître dans : Topics in Algorithmic Graph Theory, Cambridge University Press, 2019 référence BibTeX
Chromatic scheduling
et
L.W. Beineke and R.J. Wilson, Topics in Chromatic Graph Theory, Cambridge University Press, 255–276, 2015 référence BibTeX
Section 3.2
D. Cvetkovic, T. Davidovic, I. Gutman, V. Kovacevic-Vujcic, Grafovi, Optimizacija, Hemija, Raunarstvo : zapisi o radu jednog naunog projekta (Graphs, Optimization, Chemistry, Computer Science : reports on the work of a scientific project), Akademska misao, Beograd, 74–81, 2012 référence BibTeX
Vertex coloring using ant colonies
et
N. Monmarché, F. Guinand, P. Siarry, Artificial Ants : From Collective Intelligence to Real-life Optimization and Beyond, Wiley , France, 2010 référence BibTeX
La coloration des sommets d’un graphe par colonies de fourmis
et
N. Monmarché, F. Guinand, P. Siarry, Fourmis artificielles, des bases de l’optimisation aux applications industrielles, Hermes-Lavoisier, France, 2009 référence BibTeX
Metaheuristics and scheduling
, et
P. Lopez and F. Roubellat (eds.), Production Scheduling, 3, 33–68, 2008 référence BibTeX
Using local search to speed up filtering algorithms for some NP-hard constraints
, , et
Springer Berlin / Heidelberg, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science, 5015, 298–302, 2008 référence BibTeX
Recent trends in arc routing
Eds I. Hartman and M. Golumbic, Graph Theory, Combinatorics and Algorithmics : Interdisciplinary Applications, (9), Kluwer, 2005 référence BibTeX
The maximum independent set problem and augmenting graphs
et
Eds Avis, D, Hertz, A & Marcotte, O, Graph Theory and Combinatorial Optimization, (4), Springer, 2005 référence BibTeX
Les métaheuristiques : quelques conseils pour en faire bon usage
Eds Baptiste, P, Hait, A, Gestion de production et ressources humaines : méthodes de planification dans les systèmes productifs, Presses Internationales de Polytechnique, 2005 référence BibTeX
Application des métaheuristiques à la coloration des sommets d'un graphe
Résolution de problèmes de RO par les métaheuristiques, 1, Hermes Science Publication, Paris, 21–48, 2003 référence BibTeX

Actes de conférence

Two objective functions for a real life split delivery vehicle routing problem
, et
Proceedings of International Conference on Industrial Engineering and Systems Management IESM 2011, May 25-27, 1290–1299, 2011 référence BibTeX
A new ant algorithm for graph coloring
et
Proceedings of the Workshop on Nature Inspired Cooperative Strategies for Optimization, NICSO 2006, Granada, Espagne, 51–60, 2006 référence BibTeX