Subject to: Dominique de Werra

2025-04-03 · Source: Subject to · Field: Science & Research — Mathematics & Computational Sciences, Engineering & Applied Sciences · Depth: Intermediate, extended

Summary

Dominique de Werra, an Emeritus Professor at EPFL in Switzerland, discusses his extensive career in combinatorial optimization, graph theory, scheduling, and timetabling. Born in Lausanne in 1942, de Werra initially pursued physics engineering to access mathematics, later transitioning to Operations Research (OR) for his PhD in 1966, focusing on school timetabling problems using graph theory. He recounts influential encounters at a 1969 NATO conference, leading to collaborations with figures like Fred Glover and Peter Hammer, and a brief but impactful period at the University of Waterloo. De Werra returned to EPFL in 1971, where he established an OR curriculum and engaged in diverse research, including sports scheduling and collaborations with Polish and Parisian researchers. He also highlights his roles as Vice President of EPFL and President of Euro and IFORS, advocating for tutorials and humor in mathematics, and his current involvement in an EPFL-Africa AI initiative.

Key takeaway

For Operations Professionals or Research Scientists tackling complex scheduling and resource allocation, de Werra's career demonstrates the enduring power of applying graph theory and combinatorial optimization. You should prioritize interdisciplinary collaboration and revisit foundational mathematical concepts, as this approach can lead to elegant, highly effective solutions for problems ranging from sports scheduling to vaccination campaigns, even in seemingly intractable scenarios.

Key insights

Interdisciplinary application of graph theory and optimization solves complex real-world scheduling and resource allocation problems.

Principles

• Humor enhances intellectual perspective and problem-solving.
• Returning to classic works can yield novel solutions.
• Collaboration across diverse fields enriches research.

Method

Systematically apply graph theory, particularly network flows and coloring problems, to model and solve scheduling challenges, extending models as needed to fit specific constraints.

In practice

• Use graph theory for complex timetabling.
• Explore pseudo-Boolean optimization for graph problems.
• Apply taboo search to graph coloring.

Topics

• Operations Research
• Graph Theory
• Scheduling & Timetabling
• Combinatorial Optimization
• Chromatic Scheduling

Best for: Research Scientist, AI Student, Operations Professional

Related on AIssential

• GOAL: Graph-based Objective-Aligned Diffusion Solvers for Dynamic Multi-Objective Optimization — GOAL is a graph-based diffusion solver for dynamic multi-objective optimization, achieving high feasibility and speed.
• Subject to: Alain Hertz — Alan Hertz's career exemplifies the power of foundational mathematical principles applied to diverse real-world challenges.
• Ponder This Challenge - June 2026 - The Superhero Team Movies — Designing superhero movie franchises to minimize action sequences covering all hero combinations.
• Petri Net Induced Heuristic Search for Resource Constrained Scheduling — RCPSP can be effectively solved via A* search on a Petri Net reachability graph using a consistent combined heuristic.
• A Constraint Programming Approach for $n$-Day Lookahead Playoff Clinching — A novel algorithm efficiently determines NHL playoff clinching scenarios by combining tree search with constraint programming.
• Fast and Effective Redistricting Optimization via Composite-Move Tabu Search — Expanding the feasible neighborhood with composite moves significantly improves spatial optimization under contiguity constraints.

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by Subject to.