Alain Hertz

Orcid: 0000-0001-7253-3867

According to our database1, Alain Hertz authored at least 140 papers between 1986 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The average size of maximal matchings in graphs.
J. Comb. Optim., April, 2024

Graphs obtained by disjoint unions and joins of cliques and stable sets.
RAIRO Oper. Res., 2024

Extremal Chemical Graphs for the Arithmetic-Geometric Index.
CoRR, 2024

2023
Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph.
Discret. Appl. Math., August, 2023

Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph.
Graphs Comb., June, 2023

A machine learning framework for neighbor generation in metaheuristic search.
Frontiers Appl. Math. Stat., 2023

Addressing the cold start problem in privacy preserving content-based recommender systems using hypercube graphs.
CoRR, 2023

A Lagrangian-based approach to learn distance metrics for clustering with minimal data transformation.
Proceedings of the 2023 SIAM International Conference on Data Mining, 2023

2021
Resolving sets and integer programs for recommender systems.
J. Glob. Optim., 2021

Decycling bipartite graphs.
J. Graph Algorithms Appl., 2021

A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering.
Data Min. Knowl. Discov., 2021

An exact algorithm for a class of geometric set-cover problems.
Discret. Appl. Math., 2021

Exploring dual information in distance metric learning for clustering.
CoRR, 2021

Using Graph Theory to Derive Inequalities for the Bell Numbers.
CoRR, 2021

2020
An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes.
Optim. Lett., 2020

A tabu search for the design of capacitated rooted survivable planar networks.
J. Heuristics, 2020

On the edge capacitated Steiner tree problem.
Discret. Optim., 2020

An exact dynamic programming algorithm for the precedence-constrained class sequencing problem.
Comput. Oper. Res., 2020

2019
A comparison of integer programming models for the partial directed weighted improper coloring problem.
Discret. Appl. Math., 2019

Maximum eccentric connectivity index for graphs with given diameter.
Discret. Appl. Math., 2019

2018
Dominating induced matchings in graphs containing no long claw.
J. Graph Theory, 2018

A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree.
Discret. Appl. Math., 2018

Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices.
CoRR, 2018

Online algorithms for the maximum k-colorable subgraph problem.
Comput. Oper. Res., 2018

2017
Design of a wind farm collection network when several cable types are available.
J. Oper. Res. Soc., 2017

Symmetry Breaking Constraints for the Minimum Deficiency Problem.
J. Graph Algorithms Appl., 2017

Online heuristics for unloading boxes off a gravity conveyor.
Int. J. Prod. Res., 2017

Tabu Search for the RNA Partial Degradation Problem.
Int. J. Appl. Math. Comput. Sci., 2017

2016
Constructive algorithms for the partial directed weighted improper coloring problem.
J. Graph Algorithms Appl., 2016

Counting the number of non-equivalent vertex colorings of a graph.
Discret. Appl. Math., 2016

A comparison of integer and constraint programming models for the deficiency problem.
Comput. Oper. Res., 2016

2015
Foreword.
Discret. Appl. Math., 2015

Directed weighted improper coloring for cellular channel allocation.
Discret. Appl. Math., 2015

2014
Incomplete service and split deliveries in a routing problem with profits.
Networks, 2014

The split delivery capacitated team orienteering problem.
Networks, 2014

Automated generation of conjectures on forbidden subgraph characterization.
Discret. Appl. Math., 2014

A branch-and-price algorithm for the robust graph coloring problem.
Discret. Appl. Math., 2014

2013
A polynomial time algorithm for unloading boxes off a gravity conveyor.
Discret. Optim., 2013

2012
A Hybrid Heuristic for an Inventory Routing Problem.
INFORMS J. Comput., 2012

Optimizing the Design of a Wind Farm Collection Network.
INFOR Inf. Syst. Oper. Res., 2012

Integer linear programming models for a cement delivery problem.
Eur. J. Oper. Res., 2012

Total domination and the Caccetta-Häggkvist conjecture.
Discret. Optim., 2012

2011
On compact k-edge-colorings: A polynomial time reduction from linear to cyclic.
Discret. Optim., 2011

Improving constrained pattern mining with first-fail-based heuristics.
Data Min. Knowl. Discov., 2011

Using local search to speed up filtering algorithms for some NP-hard constraints.
Ann. Oper. Res., 2011

2010
On a reduction of the interval coloring problem to a series of bandwidth coloring problems.
J. Sched., 2010

Confection de calendriers de matchs pour le sport universitaire et collégial au Québec.
INFOR Inf. Syst. Oper. Res., 2010

A flexible MILP model for multiple-shift workforce planning under annualized hours.
Eur. J. Oper. Res., 2010

The undirected capacitated arc routing problem with profits.
Comput. Oper. Res., 2010

2009
A comparison of five heuristics for the multiple depot vehicle scheduling problem.
J. Sched., 2009

A patient assignment algorithm for home care services.
J. Oper. Res. Soc., 2009

The capacitated team orienteering and profitable tour problems.
J. Oper. Res. Soc., 2009

Average distance and maximum induced forest.
J. Graph Theory, 2009

Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems.
J. Comb. Optim., 2009

Lower bounds and a tabu search algorithm for the minimum deficiency problem.
J. Comb. Optim., 2009

A solution method for a car fleet management problem with maintenance constraints.
J. Heuristics, 2009

A Magnetic Procedure for the Stability Number.
Graphs Comb., 2009

Corrigendum to "Variable space search for graph coloring" [Discrete Appl. Math. 156 (2008) 2551-2560]
Discret. Appl. Math., 2009

Foreword.
Discret. Appl. Math., 2009

About equivalent interval colorings of weighted graphs.
Discret. Appl. Math., 2009

2008
On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem.
Oper. Res. Lett., 2008

A sequential elimination algorithm for computing bounds on the clique number of a graph.
Discret. Optim., 2008

Foreword.
Discret. Appl. Math., 2008

Variable space search for graph coloring.
Discret. Appl. Math., 2008

An adaptive memory algorithm for the k-coloring problem.
Discret. Appl. Math., 2008

Efficient algorithms for finding critical subgraphs.
Discret. Appl. Math., 2008

The Metric Cutpoint Partition Problem.
J. Classif., 2008

2007
A note on tree realizations of matrices.
RAIRO Oper. Res., 2007

On edge orienting methods for graph coloring.
J. Comb. Optim., 2007

Metaheuristics for the team orienteering problem.
J. Heuristics, 2007

Solution techniques for the Large Set Covering Problem.
Discret. Appl. Math., 2007

A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding.
Comput. Oper. Res., 2007

The Metric Bridge Partition Problem: Partitioning of a Metric Space into Two Subspaces Linked by an Edge in Any Optimal Realization.
J. Classif., 2007

Improving Frequent Subgraph Mining in the Presence of Symmetry.
Proceedings of the Mining and Learning with Graphs, 2007

2006
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem.
Transp. Sci., 2006

Analysis of a territorial approach to the delivery of nursing home care services based on historical data.
J. Medical Syst., 2006

Augmenting chains in graphs without a skew star.
J. Comb. Theory B, 2006

Anniversary focused issue of <i>Computers & Operations Research</i> on tabu search.
Comput. Oper. Res., 2006

A survey of local search methods for graph coloring.
Comput. Oper. Res., 2006

2005
Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints.
4OR, 2005

2004
Preface.
Discret. Appl. Math., 2004

2003
Finding augmenting chains in extensions of claw-free graphs.
Inf. Process. Lett., 2003

Guidelines for the use of meta-heuristics in combinatorial optimization.
Eur. J. Oper. Res., 2003

A variable neighborhood search for graph coloring.
Eur. J. Oper. Res., 2003

A Lower Bound for the Job Insertion Problem.
Discret. Appl. Math., 2003

P<sub>5</sub>-free augmenting graphs and the maximum stable set problem.
Discret. Appl. Math., 2003

Stable sets in two subclasses of banner-free graphs.
Discret. Appl. Math., 2003

2002
Finding the Chromatic Number by Means of Critical Graphs.
ACM J. Exp. Algorithmics, 2002

Bounds and Heuristics for the Shortest Capacitated Paths Problem.
J. Heuristics, 2002

Extension of Turán's Theorem to the 2-Stability Number.
Graphs Comb., 2002

2001
A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem.
Transp. Sci., 2001

A Transformation Which Preserves the Clique Number.
J. Comb. Theory B, 2001

2000
Planification des Emplois du Temps et de la Formation au Sein d'une Grande Entreprise.
RAIRO Oper. Res., 2000

A Tabu Search Heuristic for the Capacitated Arc Routing Problem.
Oper. Res., 2000

A framework for the description of evolutionary algorithms.
Eur. J. Oper. Res., 2000

Feasible edge colorings of trees with cardinality constraints.
Discret. Math., 2000

1999
A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems.
Oper. Res. Lett., 1999

Improvement Procedures for the Undirected Rural Postman Problem.
INFORMS J. Comput., 1999

A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization.
J. Heuristics, 1999

On perfectness of sums of graphs.
Discret. Math., 1999

On Perfect Switching Classes.
Discret. Appl. Math., 1999

Preface.
Discret. Appl. Math., 1999

On some Properties of DNA Graphs.
Discret. Appl. Math., 1999

1998
A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows.
Oper. Res., 1998

Constructing a course schedule by solving a series of assignment type problems.
Eur. J. Oper. Res., 1998

1997
An Approximation Algorithm for the Traveling Salesman Problem with Backhauls.
Oper. Res., 1997

Splitting trees.
Discret. Math., 1997

On the Use of Boolean Methods for the Computation of the Stability Number.
Discret. Appl. Math., 1997

1996
An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques.
Oper. Res., 1996

An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints.
Discret. Appl. Math., 1996

Preface.
Discret. Appl. Math., 1996

on a Scheduling Problem in a Robotized Analytical System.
Discret. Appl. Math., 1996

The Traveling Salesman Problem with Backhauls.
Comput. Oper. Res., 1996

1995
Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs.
J. Heuristics, 1995

Polynomially Solvable Cases for the Maximum Stable Set Problem.
Discret. Appl. Math., 1995

How to Decompose Constrained Course Scheduling Problems into Easier Assignment Type Subproblems.
Proceedings of the Practice and Theory of Automated Timetabling, First International Conference, Edinburgh, UK, August 29, 1995

1994
A New Polynomial-Time Algorithm for the Maximum Weighted (\chi(G) - 1)-Coloring Problem in Comparability Graphs.
Math. Syst. Theory, 1994

A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing.
Discret. Appl. Math., 1994

Local Optima Topology for the <i>k</i>-Coloring Problem.
Discret. Appl. Math., 1994

1993
On the stability number of AH-free graphs.
J. Graph Theory, 1993

Most unbreakable murky graphs are bull-free.
Graphs Comb., 1993

Bounded vertex colorings of graphs.
Discret. Math., 1993

1992
New Insertion and Postoptimization Procedures for the Traveling Salesman Problem.
Oper. Res., 1992

Foreword.
Discret. Appl. Math., 1992

Finding a feasible course schedule using Tabu search.
Discret. Appl. Math., 1992

1991
Cosine: A new graph coloring algorithm.
Oper. Res. Lett., 1991

1990
A fast algorithm for coloring Meyniel graphs.
J. Comb. Theory B, 1990

Bipolarizable graphs.
Discret. Math., 1990

Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph.
Comput. Oper. Res., 1990

The Tabu Search Metaheuristic: How we used it.
Ann. Math. Artif. Intell., 1990

Elaboration of the SEPT Expert System as the Coupling of a Simulator and a Diagnostician.
Proceedings of the Third International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 1990, July 15-18, 1990, The Mills House Hotel, Charleston, SC, USA, 1990

1989
Slim graphs.
Graphs Comb., 1989

Connected sequential colorings.
Discret. Math., 1989

Skeletal graphs - a new class of perfect graphs.
Discret. Math., 1989

STABULUS: A technique for finding stable sets in large graphs with tabu search.
Computing, 1989

1988
Consecutive colorings of graphs.
ZOR Methods Model. Oper. Res., 1988

Bipartable graphs.
J. Comb. Theory B, 1988

Perfectly orderable graphs are quasi-parity graphs: a short proof.
Discret. Math., 1988

1987
Using tabu search techniques for graph coloring.
Computing, 1987

1986
Quelques utilisations de la struction.
Discret. Math., 1986


  Loading...