1995 - EURO Gold Medal
D. de Werra spends much of his time researching Combinatorics, Discrete mathematics, Tabu search, Mathematical optimization and Theoretical computer science. His study in Indifference graph, Chordal graph, Graph, Graph coloring and Greedy coloring falls within the category of Combinatorics. His Edge coloring study in the realm of Discrete mathematics interacts with subjects such as Preemption.
His research in Tabu search is mostly focused on Guided Local Search. His study in Guided Local Search is interdisciplinary in nature, drawing from both Optimization problem and Combinatorial optimization. His work focuses on many connections between Mathematical optimization and other disciplines, such as Graph theory, that overlap with his field of interest in Function, Tabu list and Simulated annealing.
His main research concerns Combinatorics, Discrete mathematics, Bipartite graph, Mathematical optimization and Graph. His study in Edge coloring, Graph coloring, Chordal graph, Indifference graph and Greedy coloring falls under the purview of Combinatorics. His research in Edge coloring tackles topics such as Complete coloring which are related to areas like List coloring and Fractional coloring.
His work is dedicated to discovering how Discrete mathematics, Graph theory are connected with Flow network and other disciplines. His research integrates issues of Time complexity and Extension in his study of Bipartite graph. His Mathematical optimization research focuses on Theoretical computer science and how it connects with Scheduling.
Combinatorics, Discrete mathematics, Graph, Bipartite graph and Edge coloring are his primary areas of study. D. de Werra regularly links together related areas like Matching in his Discrete mathematics studies. D. de Werra combines subjects such as Time complexity, Theory of computation and Mathematical optimization with his study of Graph.
His studies deal with areas such as Graph theory, Theoretical computer science and Permutation as well as Mathematical optimization. In Edge coloring, D. de Werra works on issues like Discrete tomography, which are connected to Flow network. In his study, Brooks' theorem is inextricably linked to Greedy coloring, which falls within the broad field of Complete coloring.
His primary areas of study are Combinatorics, Discrete mathematics, Bipartite graph, Edge coloring and Graph. His research ties Polynomial and Combinatorics together. The various areas that he examines in his Edge coloring study include Graph coloring, Discrete tomography and Greedy coloring.
His Graph coloring research includes themes of Robotics, Industrial engineering, Permutation and Artificial intelligence. His Greedy coloring research is multidisciplinary, incorporating elements of Graph theory, Graph homomorphism and Brooks' theorem. D. de Werra combines subjects such as Operations research, Decision problem, Mathematical optimization and Of the form with his study of Graph.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A user's guide to tabu search
Fred Glover;Eric Taillard;Dominique de Werra.
Annals of Operations Research (1993)
Using tabu search techniques for graph coloring
A. Hertz;D. de Werra.
An introduction to timetabling
D. de Werra.
European Journal of Operational Research (1985)
Some experiments with simulated annealing for coloring graphs
M. Chams;A. Hertz;D. de Werra.
European Journal of Operational Research (1987)
Tabu search: a tutorial and an application to neural networks
D. de Werra;A. Hertz.
Or Spektrum (1989)
The tabu search metaheuristic: How we used it
A. Hertz;D. Werra.
Annals of Mathematics and Artificial Intelligence (1990)
Applications to timetabling
Edmund Burke;Dominique de Werra.
Handbook of Graph Theory (2004)
Scheduling in Sports
D. de Werra.
North-holland Mathematics Studies (1981)
Equitable colorations of graphs
D. de Werra.
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique (1971)
A tutorial on heuristic methods
Edward A. Silver;R. Victor;V. Vidal;Dominique de Werra.
European Journal of Operational Research (1980)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: