Werra Dominique de

Dominique de Werra

Information about the author Dominique de Werra will soon be added to the site.
Found 8 papers in total
From L. Euler to D. König
From L. Euler to D. König
2009
Starting from the famous Königsberg bridge problem which Euler described in 1736,...
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
2008
This paper addresses a multiprocessor generalization of the preemptive open-shop...
Three is easy, two is hard: open shop sum-batch scheduling problem refined
Three is easy, two is hard: open shop sum-batch scheduling problem refined
2006
For the two-machine open shop sum-batch problem to minimize the makespan an optimal...
Graph colouring: fundamentals and applications
Graph colouring: fundamentals and applications
2003
The classical colouring models are well known thanks in large part to their...
Circular-arc graph coloring: On chords and circuits in the meeting graph
Circular-arc graph coloring: On chords and circuits in the meeting graph
2002
In compilers register allocation in loops is usually performed by coloring a...
What is my objective function?
What is my objective function?
1997
This paper expresses some of the views of the author about OR and his warm thanks to...
The combinatorics of timetabling
The combinatorics of timetabling
1997
Various formulations of timetabling problems are given in terms of coloring problems...
A partial view of OR in Switzerland
A partial view of OR in Switzerland
1995
The authors briefly describe their views on the present situation of OR in...
Papers per page: