Dr. Maurice Cochand
Postal address
Dr.
Maurice Cochand
Departement Mathematik
HG G 32.4
Rämistrasse 101
8092 Zürich
Switzerland
More information
| Phone |
|
+41 44 632 5060 |
| E-Mail |
|
|
|
|
Interests
- Combinatorial Optimization
- Hardness of Approximation
- Random Structures and Algorithms
- Polyhedral Combinatorics
- Scheduling
Teaching
- Diskrete Optimierung
- Heuristiken in der Diskreten Optimierung
Modus Vivendi
I am presently working half-time, as I did most of my life ...
Publications
- Sous les paves... together with P. Duchet, Annals of Discrete Mathematics 17 (1983) 191-202.
- Generalized Neighbourhoods and a Class of Perfectly Orderable Graphs together with D. de Werra, Discrete Applied Mathematics 15 (1986) 213-220.
- Recognition of a Class of Unimodular Functions together with D. de Werra and B. Simeone, Discrete Applied Mathematics 15 (1986) 213-220.
- Preemptive Scheduling with Staircase and Piecewise Linear Ressource Availability together with D. de Werra and R. Slowinsky, ZOR, Methods and Models of Operations Research 33 (1989) 297-313.
- A few Remarks on Orientation of Graphs and Ramsey Theory together with P. Duchet, in G. Halasz and V.T. Sos eds, Irregularities of Partitions, Algorithms and Combinatorics: Study and Research texts 8 (Springer, Berlin, 1989) 39-46.
- Lattice Matrices, Intersection of Ring Families and Dicuts together with A. Gaillard and H. Groeflin, Discrete Mathematics 110 (1992) 61-80.
- Fixed Points Operators for the Generalized Maximum Satisfiability Problem Discrete Applied Mathematics 46 (1993) 117-132.
- Probabilistic Estimates for the Generalized Maximum Satisfiability Problem Discrete Applied Mathematics 49 (1994) 143-163.
- On Preemptive Scheduling: A General Setting for the Two-Phase Method together with A. Gaillard, Discrete Applied Mathematics 65 (1996) 157-166.
- Optimum Partitioning into Intersections of Ring Families together with A. Gaillard and H. Groeflin, Discrete Applied Mathematics 76 (1997) 81-91.
- A Dynamical System Based Heuristic for a Class of Constrained Semi-Assignment Problems together with M. Burkard and A. Gaillard, Selected papers of the international Conference on Operations Research (Springer 1998) 182-191.
- On a Graph Colouring Problem together with G. Karolyi, Discrete Mathematics 194 (1999) 249-252.
- On Gateways and Satisfiability short note, Proceedings of the International School-Seminar on Discrete Mathematics and Cybernetics, Moscow, June 2001.