De Werra D.

D. De Werra

Information about the author D. De Werra will soon be added to the site.
Found 9 papers in total
Mixed graph colorings
Mixed graph colorings
1997
A mixed graph GÅ𝒪 contains both undirected edges and directed arcs. A k-...
A review of combinatorial problems arising in feedforward neural network design
A review of combinatorial problems arising in feedforward neural network design
1994
This paper is primarily oriented towards discrete mathematics and emphasizes the...
Nonpreemptive open shop with restricted processing times
Nonpreemptive open shop with restricted processing times
1994
A polynomial time algorithm was given by Fiala for the nonpreemptive m- processor open...
Basic ideas of Tabu Search with an application to Traveling Salesman and Quadratic Assignment
Basic ideas of Tabu Search with an application to Traveling Salesman and Quadratic Assignment
1992
A general presentation of Tabu Search is given with emphasis on parallelization;...
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
1992
An edge coloring model is presented for a preemptive open shop problem. Constraints...
A preemptive open shop scheduling problem with one source
A preemptive open shop scheduling problem with one source
1991
A model for a preemptive open shop scheduling problem is presented and constraints due...
Almost nonpreemptive schedules
Almost nonpreemptive schedules
1990
Graph-theoretical models are described for solving preemptive and nonpreemptive...
A convoy scheduling problem
A convoy scheduling problem
1991
A mixed-integer programming formulation is given for the problem of scheduling the...
On the use of augmenting chains in chain packings
On the use of augmenting chains in chain packings
1991
In a graph G=(X,E), we assign to each node ν a positive integer b(ν)•d G...
Papers per page: