Hertz Alain

Alain Hertz

Information about the author Alain Hertz will soon be added to the site.
Found 33 papers in total
Design of a wind farm collection network when several cable types are available
Design of a wind farm collection network when several cable types are available
2017
In this article we consider a real‐world problem submitted to us by the Hatch...
Planification des Emplois du Temps et de la Formation au Sein d'une Grande Entreprise
Planification des Emplois du Temps et de la Formation au Sein d'une Grande Entreprise
2000
We describe an O.R. technique which plans the allotment of time of the collaborators...
The undirected capacitated arc routing problem with profits
The undirected capacitated arc routing problem with profits
2010
A profit and a demand are associated with each edge of a set of profitable edges of a...
Total domination and the Caccetta–Häggkvist conjecture
Total domination and the Caccetta–Häggkvist conjecture
2012
A total dominating set in a digraph G is a subset W of its vertices such that every...
On compact k‐edge‐colorings: A polynomial time reduction from linear to cyclic
On compact k‐edge‐colorings: A polynomial time reduction from linear to cyclic
2011
A k ‐edge‐coloring of a graph G = ( V , E ) is a function c that assigns...
Using local search to speed up filtering algorithms for some NP‐hard constraints
Using local search to speed up filtering algorithms for some NP‐hard constraints
2011
This paper proposes to use local search inside filtering algorithms of combinatorial...
On a reduction of the interval coloring problem to a series of bandwidth coloring problems
On a reduction of the interval coloring problem to a series of bandwidth coloring problems
2010
Given a graph G =( V , E ) with strictly positive integer weights ω i on the...
A solution method for a car fleet management problem with maintenance constraints
A solution method for a car fleet management problem with maintenance constraints
2009
The problem retained for the ROADEF'99 international challenge was an inventory...
Lower bounds and a tabu search algorithm for the minimum deficiency problem
Lower bounds and a tabu search algorithm for the minimum deficiency problem
2009
An edge coloring of a graph G =( V , E ) is a function c : E ⇒ℕ that assigns...
A note on tree realizations of matrices
A note on tree realizations of matrices
2007
It is well known that each tree metric M has a unique realization as a tree, and that...
A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
2007
We consider a monthly crew scheduling problem with preferential bidding in the airline...
A survey of local search methods for graph coloring
A survey of local search methods for graph coloring
2006
Tabucol is a tabu search algorithm that tries to determine whether the vertices of a...
Metaheuristics for the team orienteering problem
Metaheuristics for the team orienteering problem
2007
The Team Orienteering Problem (TOP) is the generalization to the case of multiple...
The allocation of time and training to ensure a well-trained “next generation” in a large business
The allocation of time and training to ensure a well-trained “next generation” in a large business
2000
We describe an OR technique which plans the allotment of time of the collaborators of...
A variable neighborhood search for graph coloring
A variable neighborhood search for graph coloring
2003
Descent methods for combinatorial optimization proceed by performing a sequence of...
Guidelines for the use of meta-heuristics in combinatorial optimization
Guidelines for the use of meta-heuristics in combinatorial optimization
2003
the 18th EURO Summer/Winter Institute (ESWI XVIII) took place during the spring 2000...
Bounds and heuristics for the shortest capacitated paths problem
Bounds and heuristics for the shortest capacitated paths problem
2002
Given a graph G , the Shortest Capacitated Paths Problem (SCPP) consists of...
A framework for the description of evolutionary algorithms
A framework for the description of evolutionary algorithms
2000
Evolutionary algorithms are optimisation techniques inspired from natural evolution...
A tabu search heuristic for the capacitated arc routing problem
A tabu search heuristic for the capacitated arc routing problem
2000
The Capacitated Arc Routing Problem arises in several contexts where streets or roads...
On a graph transformation that preserves the stability number
On a graph transformation that preserves the stability number
2000
We derive from Boolean methods a transformation which, when applicable, builds from a...
An approximation algorithm for the traveling salesman problem with backhauls
An approximation algorithm for the traveling salesman problem with backhauls
1997
The Traveling Salesman Problem with Backhauls (TSPB) is defined on a graph G =...
A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems
A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems
1999
We consider the ordered cluster traveling salesman problem (OCTSP). In this problem, a...
On some properties of DNA graphs
On some properties of DNA graphs
1999
Molecular biology, which aims to study DNA and protein structure and functions, has...
Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
1995
We present in this article an evolutionary procedure for solving general optimization...
Papers per page: