Dominique de Werra
Dominique de Werra was born in Switzerland in 1942. He graduated in physical engineering at EPFL in 1965, and in 1969, a doctorate in technical sciences. From 1969 to 1971 he was professor at Waterloo University (Canada) in the Management Sciences department. He has been a visiting professor in various European and American High Schools. In 1971 he became professor of Operations Research in Mathematics at EPFL. In 1990, he was appointed Vice President of EPFL and in addition, he became Director of training in autumn 1993. His research focuses on discrete mathematics (combinatorial optimization, graph theory, algorithms, etc.) and their applications to industrial and informatics technology. He has participated and directed several interdisciplinary projects in production, distribution, energy and scheduling. His work leads in particular to the time management problem and specifically to calendar management for important projects (sports, education, etc.). In 1987-1988, he chaired the EURO association which encompasses the Operational Research in Europe. He is Dr. h.c. of Paris University and Ecole Polytechnique in Poznan, and he was the winner of the European gold medal (EURO) of Operational Research in 1995. In March 2000 he was appointed Dean of International Affairs.
2025
Conference Papers
Minimizing breaks in incomplete round-robin tournaments
2025. 13 Latin American Algorithms, Graphs, and Optimization Symposium (LAGOS 2025), Buenos Aires, Argentina, 2025-11-10 - 2025-11-14. p. 94 - 101. DOI : 10.1016/j.procs.2025.10.285.Book Chapters
Metaheuristics for Problems in Sports Scheduling
Handbook of Heuristics; Cham: Springer Nature Switzerland, 2025. p. 1 - 30.2023
Journal Articles
A tutorial on graph models for scheduling round-robin sports tournaments
International Transactions In Operational Research. 2023. DOI : 10.1111/itor.13290.Books
Combinatorial Models for Scheduling Sports Tournaments
Cham: Springer International Publishing, 2023.Book Chapters
Leagues, Tournaments, and Schedules
Combinatorial Models for Scheduling Sports Tournaments; Cham: Springer Nature, 2023. p. 1 - 20.Integer Programming Approaches
Combinatorial Models for Scheduling Sports Tournaments; Cham: Springer Nature, 2023. p. 99 - 115.Combinatorial Structures
Combinatorial Models for Scheduling Sports Tournaments; Cham: Springer Nature, 2023. p. 21 - 56.Metaheuristics and Local Search
Combinatorial Models for Scheduling Sports Tournaments; Cham: Springer Nature, 2023. p. 57 - 98.2022
Journal Articles
The micro-world of cographs
Discrete Applied Mathematics. 2022. DOI : 10.1016/j.dam.2021.11.004.2021
Journal Articles
Recoloring subgraphs of K-2n for sports scheduling
Theoretical Computer Science. 2021. DOI : 10.1016/j.tcs.2021.03.029.2020
Journal Articles
Letter graphs and geometric grid classes of permutations: Characterization and recognition
Discrete Applied Mathematics. 2020. DOI : 10.1016/j.dam.2020.01.038.Minimal graphs for 2-factor extension
Discrete Applied Mathematics. 2020. DOI : 10.1016/j.dam.2019.11.022.Conference Papers
The Micro-world of Cographs
2020. 31st International Workshop on Combinatorial Algorithms (IWOCA 2020), Bordeaux, France, 2020-06-08 - 2020-06-10. p. 30 - 42. DOI : 10.1007/978-3-030-48966-3_3.Book Chapters
Les expériences de l’EPFL dans l’international
The Many Facets of International Education of Engineers = Les Multiples Facettes de la Formation Internationale des Ingénieurs : Proceedings of the International Conference SEFI 2000, Paris, France, 6-8 September 2000 / edited by Jean Michel.; CRC Press, 2020.2018
Conference Papers
Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition
2018. 28th International Workshop on Combinational Algorithms (IWOCA), Newcastle, AUSTRALIA, Jul 17-21, 2017. p. 195 - 205. DOI : 10.1007/978-3-319-78825-8_16.2016
Reviews
Edge coloring: A natural model for sports scheduling
European Journal of Operational Research. 2016. DOI : 10.1016/j.ejor.2016.03.038.2015
Journal Articles
Combinatorics and Algorithms for Augmenting Graphs
Graphs and Combinatorics. 2015. DOI : 10.1007/s00373-015-1660-0.Books
Operations Research and Enterprise Systems: 4th International Conference, ICORES 2015, Lisbon, Portugal, January 10-12, 2015, Revised Selected Papers
Cham: Springer International Publishing, 2015.Book Chapters
Chromatic scheduling
Topics in Chromatic Graph Theory; Cambridge University Press, 2015. p. 255 - 276.2014
Journal Articles
Combinatorial Optimization [Preface]
DISCRETE APPLIED MATHEMATICS. 2014. DOI : 10.1016/j.dam.2013.11.011.Book Chapters
Graph Coloring Problems
Paradigms of Combinatorial Optimization: Problems and New Approaches; Wiley Blackwell, 2014. p. 265 - 310.2013
Book Chapters
Graph Coloring Problems
Paradigms of Combinatorial Optimization: Problems and New Approaches; John Wiley and Sons, 2013. p. 265 - 310.2012
Journal Articles
A note on chromatic properties of threshold graphs
Discrete Mathematics. 2012. DOI : 10.1016/j.disc.2012.01.036.Conference Papers
(p,q) - Choosability of Grid Graphs
2012. Annual International Conference on Computational Mathematics, Computational Geometry & Statistics (2012(, 2012. DOI : 10.5176/2251-1911_cmcgs57.Book Chapters
Swiss Operations Research Society (Schweizerische Vereinigung Für Operations Research/Association Suisse Pour La Recherche Operationelle/Associazione Svizzera Di Ricerca Operativa)
Wiley Encyclopedia of Operations Research and Management Science; Wiley, 2012.2011
Journal Articles
Minimum d-Transversals of Maximum-Weight Stable Sets in Trees
Electronic Notes in Discrete Mathematics. 2011. DOI : 10.1016/j.endm.2011.09.022.Minimum d-blockers and d-transversals in graphs
Journal Of Combinatorial Optimization. 2011. DOI : 10.1007/s10878-010-9334-6.The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models
Annals Of Operations Research. 2011. DOI : 10.1007/s10479-011-0913-4.2010
Journal Articles
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid
Discrete Mathematics. 2010. DOI : 10.1016/j.disc.2009.08.009.On the use of graphs in discrete tomography
Annals Of Operations Research. 2010. DOI : 10.1007/s10479-009-0649-6.Split-critical and uniquely split-colorable graphs
Discrete Mathematics And Theoretical Computer Science. 2010. DOI : 10.46298/dmtcs.484.A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
Operations Research Letters. 2010. DOI : 10.1016/j.orl.2009.10.007.Book Chapters
Les mathématiques appliquées à l'École polytechnique de Lausanne
math.ch/100 Schweizerische Mathematische Gesellschaft – Société Mathématique Suisse – Swiss Mathematical Society 1910 - 2010; Zurich: European Mathematical Society, 2010. p. 241 - 245.Complexity and Approximation Results for the Min Weighted Node Coloring Problem
Combinatorial Optimization and Theoretical Computer Science: Interfaces and Perspectives: 30th Anniversary of the LAMSADE; Wiley-ISTE, 2010. p. 259 - 289.Weighted Edge Coloring
Combinatorial Optimization and Theoretical Computer Science: Interfaces and Perspectives: 30th Anniversary of the LAMSADE; Wiley-ISTE, 2010. p. 291 - 317.2009
Journal Articles
A Magnetic Procedure for the Stability Number
Graphs And Combinatorics. 2009. DOI : 10.1007/s00373-010-0886-0.Degree-constrained edge partitioning in graphs arising from discrete tomography
Journal of Graph Algorithms and Applications. 2009. DOI : 10.7155/jgaa.00178.Graph coloring with cardinality constraints on the neighborhoods
Discrete Optimization. 2009. DOI : 10.1016/j.disopt.2009.04.005.2008
Journal Articles
Addendum to "Bicolored matchings in some classes of graphs"
Graphs and Combinatorics. 2008. DOI : 10.1007/s00373-008-0771-2.On a graph coloring problem arising from discrete tomography
Networks. 2008. DOI : 10.1002/net.20218.Construction of balanced sports schedules using partitions into subleagues
Operations Research Letters. 2008. DOI : 10.1016/j.orl.2007.09.007.Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
Journal Of Scheduling. 2008. DOI : 10.1007/s10951-007-0050-8.On two coloring problems in mixed graphs
European Journal of Combinatorics. 2008. DOI : 10.1016/j.ejc.2007.03.006.A tutorial on the use of graphs in discrete tomography
4OR. 2008. DOI : 10.1007/s10288-008-0077-5.Polar cographs
Discrete Applied Mathematics. 2008. DOI : 10.1016/j.dam.2007.08.025.Conference Papers
Finding Hamiltonian circuits in quasi-adjoint graphs
2008. 5th International Conference on Graphs and Optimization, Leukerbad, SWITZERLAND, Aug, 2006. p. 2573 - 2580. DOI : 10.1016/j.dam.2008.03.014.Polarity of chordal graphs
2008. 5th International Conference on Graphs and Optimization, Leukerbad, SWITZERLAND, Aug, 2006. p. 2469 - 2479. DOI : 10.1016/j.dam.2008.01.026.Theses
Some coloring and walking problems in graphs
Lausanne, EPFL, 2008. DOI : 10.5075/epfl-thesis-4090.2007
Journal Articles
Bicolored matchings in some classes of graphs
Graphs and Combinatorics. 2007. DOI : 10.1007/s00373-006-0686-8.Time slot scheduling of compatible jobs
Journal of Scheduling. 2007. DOI : 10.1007/s10951-006-0003-7.Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization
Annals of Operations Research. 2007. DOI : 10.1007/s10479-006-0101-0.Theses
Variations of coloring problems related to scheduling and discrete tomography
Lausanne, EPFL, 2007. DOI : 10.5075/epfl-thesis-3968.Book Chapters
Problèmes de coloration dans les graphes
Optimisation Combinatoire; Paris: Hermès Science, 2007. p. 95 - 141.2006
Journal Articles
Construction of sports schedules with multiple venues
Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.03.011.On the approximation of Min Split-coloring and Min Cocoloring
Journal of Graph Algorithms and Applications. 2006.Good and nice colorings of balanced hypergraphs
Discrete Mathematics. 2006. DOI : 10.1016/j.disc.2005.12.044.Some simple optimization techniques for self-organized public key management in mobile ad hoc networks
Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.12.002.Using graphs for some discrete tomography problems
Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.07.003.Three is easy, two is hard: open shop sum-batch scheduling problem refined
Operations Research Letters. 2006. DOI : 10.1016/j.orl.2005.07.006.Locally Restricted Colorings
Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.05.012.Theses
Generalized vertex coloring problems using split graphs
Lausanne, EPFL, 2006. DOI : 10.5075/epfl-thesis-3629.Reports
Variations of split-coloring in permutation graphs
20062005
Journal Articles
Bicolored matchings in some classes of graphs
Electronic Notes in Discrete Mathematics. 2005. DOI : 10.1016/j.endm.2005.06.033.On split-coloring problems
Journal of Combinatorial Optimization. 2005. DOI : 10.1007/s10878-005-4103-7.Variations on the Roy-Gallai Theorem
4OR. 2005.Path colorings in bipartite multigraphs
European Journal of Operational Research. 2005. DOI : 10.1016/j.ejor.2003.05.007.A hypocoloring model for batch scheduling
Discrete Applied Mathematics. 2005. DOI : 10.1016/j.dam.2004.06.016.(p,k)-coloring problems in line graphs
Theoretical Computer Science. 2005. DOI : 10.1016/j.tcs.2005.09.037.Partitioning cographs into cliques and stable sets
Discrete Optimization. 2005. DOI : 10.1016/j.disopt.2005.03.003.A solvable case of image reconstruction in discrete tomography
Discrete Applied Mathematics. 2005. DOI : 10.1016/j.dam.2005.03.006.Theses
Suboptimal colorings and solution of large chromatic scheduling problems
Lausanne, EPFL, 2005. DOI : 10.5075/epfl-thesis-3363.Book Chapters
Hypergraph coloring by bichromatic exchanges
Graph Theory and Combinatorial Optimization; Springer Verlag, 2005. p. 255 - 264.Reports
Polar cographs
20052004
Journal Articles
On Some Properties of Suboptimal Colorings of Graphs
Networks. 2004. DOI : 10.1002/net.10107.Conference Papers
The hypocoloring problem: complexity and approximability results when the chromatic number is small
2004. 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004. p. 377 - 388. DOI : 10.1007/978-3-540-30559-0_32.Weighted coloring: on planar bipartite and split graphs: complexity and improved approximation
2004. 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004. p. 896 - 907. DOI : 10.1007/978-3-540-30551-4_76.Theses
Some combinatorial optimization problems in graphs with applications in telecommunications and tomography
Lausanne, EPFL, 2004. DOI : 10.5075/epfl-thesis-3082.Book Chapters
Applications to timetabling
Handbook of Graph Theory; CRC Press London, 2004. p. 445 - 474.Tabu search
Local Search in Combinatorial Optimization; Princeton University Press, 2004. p. 121 - 136.Colorings and Related Topics
Handbook of Graph Theory; CRC Press, 2004. p. 340 - 483.Reports
Color-blind Graphs and Suboptimal Colorings
2004Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
20042003
Journal Articles
Colorations de graphes: fondements et applications
RAIRO Operations Research. 2003. DOI : 10.1051/ro:2003013.Struction revisited
Discrete Applied Mathematics. 2003. DOI : 10.1016/S0166-218X(03)00388-3.Using stable sets to bound the chromatic number
Information Processing Letters. 2003. DOI : 10.1016/S0020-0190(03)00266-7.Variations on the theorem of Birkhoff-von Neumann and extensions
Graphs and Combinatorics. 2003. DOI : 10.1007/s00373-002-0496-6.Partitioning the edge set of a bipartite graph into chain packings: complexity of some variations
Linear Algebra and its Applications. 2003. DOI : 10.1016/S0024-3795(02)00691-2.Conference Papers
Special issue on stability in graphs and related topics
2003. Stability in Graphs and Related Topics (2002), Switzerland, 2002-07-01 - 2002-07-01. p. 1 - 2. DOI : 10.1016/S0166-218X(03)00385-8.Book Chapters
Constraints of availability in timetabling and scheduling
Practice and Theory of Automated Timetabling IV; Springer Verlag, 2003. p. 3 - 23.2002
Journal Articles
Complexity of some special types of timetabling problems
Journal of Scheduling. 2002. DOI : 10.1002/jos.97.Circular-arc graph coloring: on chords and circuits in the meeting graph
European Journal of Operational Research. 2002. DOI : 10.1016/S0377-2217(01)00058-3.A generalized class-teacher model for timetabling problems
European Journal of Operational Research. 2002. DOI : 10.1016/S0377-2217(01)00342-3.Conference Papers
Weighted node coloring: when stable sets are expensive
2002. 28th International Workshop, WG 2002, Český Krumlov, Czech Republic, June 13–15, 2002. p. 113 - 125. DOI : 10.1007/3-540-36379-3_11.Book Chapters
Connectivity, transitivity and chromaticity: the pioneering work of Bernard Roy in Graph Theory
Aiding Decisions with Multiple Criteria; Kluwer Academic Publishers, 2002. p. 23 - 42.2000
Journal Articles
Variations on the theorem of Birkhoff-von Neumann and extensions
Electronic Notes in Discrete Mathematics. 2000. DOI : 10.1016/S1571-0653(05)80135-0.Feasible edge colorings of trees with cardinality constraints
Discrete Mathematics. 2000. DOI : 10.1016/S0012-365X(00)00006-6.1999
Journal Articles
Restricted graph coloring: some mathematical programming models
CRM Processings & Lectures Notes. 1999.On perfectness of sums of graphs
Discrete Mathematics. 1999. DOI : 10.1016/S0012-365X(98)00168-X.On a graph-theoretical model for cyclic register allocation
Discrete Applied Mathematics. 1999. DOI : 10.1016/S0166-218X(99)00105-5.On a multiconstrained model for chromatic scheduling
Discrete Applied Mathematics. 1999. DOI : 10.1016/S0166-218X(99)00019-0.On some properties of DNA graphs
Discrete Applied Mathematics. 1999. DOI : 10.1016/S0166-218X(99)00109-2.Book Chapters
Restricted graph coloring: some mathematical programming models
CRM Processings & Lecture Notes; 1999. p. 135 - 148.1997
Journal Articles
What is my objective function?
European Journal of Operational Research. 1997. DOI : 10.1016/s0377-2217(96)00393-1.Mixed graphs colorings
Mathematical Methods of Operations Research. 1997. DOI : 10.1007/BF01194253.The combinatorics of timetabling
European Journal of Operational Research. 1997. DOI : 10.1016/S0377-2217(96)00111-7.Preassignment requirements in chromatic scheduling
Discrete Applied Mathematics. 1997. DOI : 10.1016/S0166-218X(97)82776-X.Restricted colorings models for timetabling
Discrete Mathematics. 1997. DOI : 10.1016/S0012-365X(96)00208-7.Conference Papers
Nesticity
1997. DIMACS Workshop, November 13-15, 1996. p. 225 - 232. DOI : 10.1090/dimacs/037/14.Reviews
Lectures on mathematical programming ismp97. Preface
Mathematical Programming. 1997. DOI : 10.1007/bf02614307.Book Chapters
Tabu Search
Local search in combinatorial optimization; N.Y.: John Wiley & Sons Ltd, 1997. p. 121 - 136.1996
Journal Articles
Restrictions and pre-assignments in preemptive open shop scheduling
Discrete Applied Mathematics. 1996. DOI : 10.1016/0166-218X(95)00055-V.Deadline scheduling of multiprocessor tasks
Discrete Applied Mathematics. 1996. DOI : 10.1016/0166-218X(95)00020-R.Open shop scheduling with some additional constraints
Graphs and Combinatorics. 1996. DOI : 10.1007/BF01858447.Book Chapters
Some combinatorial models for course scheduling
Practice and Theory of Automated Timetabling. PATAT 1995; Springer Verlag, 1996. p. 296 - 308.1995
Journal Articles
A chromatic scheduling model with costs
IISE Transactions. 1995. DOI : 10.1080/07408179508936730.Theses
Méthodes d'optimisation combinatoire pour des problèmes de graphes
Lausanne, EPFL, 1995. DOI : 10.5075/epfl-thesis-1315.Heuristiken für kombinatorische Optimierung und semantische Bildinhaltserkennung mit Techniken der künstlichen Intelligenz
Lausanne, EPFL, 1995. DOI : 10.5075/epfl-thesis-1333.Book Chapters
Some graph coloring models for cyclic scheduling
Scheduling Theory and its Applications; N.Y.: John Wiley & Sons Ltd, 1995. p. 227 - 239.1994
Journal Articles
Scheduling Periodic Jobs Compactly Within A Fixed Time Period In Open Shops
INFOR: Information Systems and Operational Research. 1994. DOI : 10.1080/03155986.1994.11732242.Scheduling periodic jobs compacly within a fixed time period in open shops
INFOR: Information Systems and Operational Research. 1994.Chordless paths, odd holes and kernels in graphs without m-obstructions
Journal of Algorithms. 1994. DOI : 10.1006/jagm.1994.1031.A sufficient condition to equitable edge colorings of simple graphs
Discrete Mathematics. 1994. DOI : 10.1016/0012-365X(94)90112-0.On an optimization problem occurring in FMMs: a hypergraph theoretical formulation
Discrete Applied Mathematics. 1994. DOI : 10.1016/0166-218X(94)90002-7.Extensions of colorings models for scheduling purposes
European Journal of Operational Research. 1994. DOI : 10.1016/0377-2217(96)00013-6.Scheduling independent multi processor tasks on a uniform k-processor system
Parallel computing. 1994. DOI : 10.1016/0167-8191(94)90110-4.A discrete model for studying existence and uniqueness of solution sin non linear resistive circuits
Discrete Applied Mathematics. 1994. DOI : 10.1016/0166-218X(92)00152-C.A review of combinatorial problems arising in feed forward neural network design
Discrete Applied Mathematics. 1994. DOI : 10.1016/0166-218X(92)00184-N.Chromatic scheduling and frequency assignment
Discrete Applied Mathematics. 1994. DOI : 10.1016/0166-218X(94)90207-0.Non preemptive open shop with restricted processing times
Zeitschrift für Operations Research. 1994. DOI : 10.1007/BF01415583.Conference Papers
Preassignments in Chromatic Scheduling
1994. 18th Symposium on Operations Research (1993), Cologne, 1993-09-01 - 1993-09-03. p. 526 - 528. DOI : 10.1007/978-3-642-46955-8_134.Theses
From finding maximum feasible subsystems of linear systems to feedforward neural network design
Lausanne, EPFL, 1994. DOI : 10.5075/epfl-thesis-1282.1993
Journal Articles
The cyclic compact open-shop scheduling problem
Discrete Mathematics. 1993. DOI : 10.1016/0012-365X(93)90171-O.On the stability number of AH-free graphs
Journal of Graph Theory. 1993. DOI : 10.1002/jgt.3190170107.Edge-chromatic scheduling with simultaneity constraints
SIAM Journal on Discrete Mathematics. 1993. DOI : 10.1137/0406048.EPCOT : an Efficient Procedure for Coloring Optimally with Tabu search
Computers & Mathematics with Applications. 1993. DOI : 10.1016/0898-1221(93)90279-5.Addendum: some preemptive open shop scheduling problems with a renewable or a non renewable resource
Discrete Applied Mathematics. 1993. DOI : 10.1016/0166-218X(93)90172-K.Graph endpoint coloring and distributed processing: A scheduling problem in distributed processing
Networks. 1993. DOI : 10.1002/net.3230230203.Some graph-theoretical models for scheduling in automated production systems
Networks. 1993. DOI : 10.1002/net.3230230803.The burrow system of the fossorial form of the water vole (arvicola Terrestris L.)
Mammalia. 1993. DOI : 10.1515/mamm.1993.57.3.423.Theses
Feedforward boolean neural networks with discrete weights : computational power and training
Lausanne, EPFL, 1993. DOI : 10.5075/epfl-thesis-1157.Elaboration de tournées de véhicules sous contraintes d'accessibilité
Lausanne, EPFL, 1993. DOI : 10.5075/epfl-thesis-1163.Recherches itératives dirigées parallèles
Lausanne, EPFL, 1993. DOI : 10.5075/epfl-thesis-1153.1992
Journal Articles
Discrete Applied Mathematics Volume 35, Issue 3, 6 March 1992, Pages 175-176. Foreword
Discrete Applied Mathematics. 1992. DOI : 10.1016/0166-218x(92)90242-3.Cylindrical open shop scheduling: some solvable cases
Vishwa International Journal of Graph Theory. 1992.Basic ideas of Tabu search with an application to traveling salesman and quadratic assignment
Ricerca Operativa. 1992.Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
Discrete Applied Mathematics. 1992. DOI : 10.1016/0166-218X(92)90245-6.Reviews
Greenberg, H. J., Glover, E: Annals of OR, Vol 21: "Linkages with Artificial Intelligence" (Basel: J. C. Baltzer 1989). [Buchbesprechung]
Operations-Research-Spektrum. 1992. DOI : 10.1007/bf01783520.1991
Journal Articles
Idendifying mythological scenes with artificial intelligence
Science and Archeology. 1991.Compact cylindrical chromatic scheduling
SIAM Journal on Discrete Mathmematics. 1991. DOI : 10.1137/0404046.A preemptive open shop scheduling problem with one resource
Operations Research Letters. 1991. DOI : 10.1016/0167-6377(91)90080-9.On the use of augmenting chains in chain packings
Discrete Applied Mathematics. 1991. DOI : 10.1016/0166-218X(91)90039-Y.A convoy scheduling problem
Discrete Applied Mathematics. 1991. DOI : 10.1016/0166-218X(91)90009-L.Loading problems with tool management in flexible manufacturing systems: a few integer programming models
International Journal of Flexible Manufacturing Systems. 1991. DOI : 10.1007/BF00167526.Theses
Nouvelles approches mathématiques des problèmes de conception et de pilotage des ateliers flexibles
Lausanne, EPFL, 1991. DOI : 10.5075/epfl-thesis-975.Book Chapters
Graph coloring models for scheduling in automated production systems
Proceedings of the second conference of the Association of Asian-Pacific Operational Research Societies APORS; Peking University Press, 1991. p. 26 - 34.1990
Journal Articles
Recognition of a class of unimodular functions
Discrete Applied Mathematics. 1990. DOI : 10.1016/0166-218X(90)90147-5.Scheduling independent two-processor tasks on a uniform duo-processor system
Discrete Applied Mathematics. 1990. DOI : 10.1016/0166-218X(90)90090-Y.A note on SS/TDMA, satellite communication
Linear Algebra and its Applications. 1990. DOI : 10.1016/0024-3795(90)90116-T.Almost nonpreemptive schedules
Annals of Operations Research. 1990. DOI : 10.1007/BF02248592.The Tabu search metaheuristic: how we used it
Annals of Mathematics and Artificial Intelligence. 1990. DOI : 10.1007/BF01531073.A constrained sports scheduling problem
Discrete Applied Mathematics. 1990. DOI : 10.1016/0166-218X(90)90019-9.TABARIS: an exact algorithm based on Tabu search for finding a maximum independent set in a graph
Computers and Operations Research. 1990. DOI : 10.1016/0305-0548(90)90048-C.Reviews
A. Gibbons and W. Rytter "Efficient parallel algorithms" (Cambridge University Press, Cambridge, 1988)
European Journal of Operational Research. 1990. DOI : 10.1016/0377-2217(90)90254-9.Theses
Sur quelques problèmes combinatoires relatifs à l'ordonnancement
Lausanne, EPFL, 1990. DOI : 10.5075/epfl-thesis-897.Modèles mathématiques pour une gestion efficace des ateliers flexibles
Lausanne, EPFL, 1990. DOI : 10.5075/epfl-thesis-839.1989
Journal Articles
Tabu search techniques - A tutorial and an application to neural networks
OR Spektrum. 1989. DOI : 10.1007/BF01720782.Connected sequential colorings
Discrete Mathematics. 1989. DOI : 10.1016/0012-365X(89)90197-0.Tabu search: a tutorial and an application to neural networks
OR Spektrum. 1989.An interactive system for constructing timetables on a PC
European Journal of Operational Research. 1989. DOI : 10.1016/0377-2217(89)90269-5.Preemptive scheduling with staircase and piecewise linear resource availability
Zeitschrift für Operations Research. 1989. DOI : 10.1007/BF01416077.Discrete Mathematics Volume 74, Issues 1–2, 1989. Foreword
Discrete Mathematics. 1989. DOI : 10.1016/0012-365x(89)90192-1.Paths, chains and antipaths
Networks. 1989. DOI : 10.1002/net.3230190109.STABULUS: a technique for finding stable sets in large graphs with tabu search
Computing. 1989. DOI : 10.1007/BF02243141.Generalized edge packings
Mathematical Programming. 1989. DOI : 10.1007/BF01587091.Odd path packings
European Journal of Operational Research. 1989. DOI : 10.1016/S0195-6698(89)80075-7.Conference Papers
Variations on matchings
1989. 17th DGOR Annual Meeting, Berlin, 1988-09-13 - 1988-09-16. DOI : 10.1007/978-3-642-74862-2_50.Theses
La coloration des sommets d'un graphe et son application à la confection d'horaires
Lausanne, EPFL, 1989. DOI : 10.5075/epfl-thesis-785.Book Chapters
Heuristics for graph coloring
Computational graph theory; Springer Verlag NY, 1989. p. 171 - 185.Packing independent sets and transversals
Combinatorics and graph theory; Warsaw: Banach Center Publications, 1989. p. 233 - 240.Apprentissage dans les réseaux de Hopfield
Comptes rendus des journées d'électronique; Presses Polytechniques Romandes, 1989. p. 77 - 85.Graph-theoretical models for preemptive scheduling
Advances in Project Scheduling; Amsterdam: Elsevier, 1989. p. 171 - 185.1988
Journal Articles
On the two-phase method for preemptive scheduling
European Journal of Operational Research. 1988. DOI : 10.1016/0377-2217(88)90332-3.On randomized stopping points and perfect graphs
Journal of Combinatorial Theory, Series B. 1988. DOI : 10.1016/0095-8956(88)90076-7.Perfectly orderable graphs are quasi-parity graphs
Discrete Mathematics. 1988. DOI : 10.1016/0012-365X(88)90047-7.Consecutive colorings of graphs
Zeitschrift für Operations Research. 1988. DOI : 10.1007/BF01920567.From linear separability to unimodality: a hierarchy of pseudo-boolean functions
SIAM Journal on Discrete Mathematics. 1988. DOI : 10.1137/0401019.Some models of graphs for scheduling sports competitions
Discrete Applied Mathematics. 1988. DOI : 10.1016/0166-218X(88)90033-9.1987
Journal Articles
Design and operation of flexible manufacturing systems : the kingdom of heuristic methods
RAIRO - Operations Research. 1987. DOI : 10.1051/ro/1987210403651.Design and operation of flexible manufacturing systems: the kingdom of heuristics
Revue française d'Automatique, d'Informatique et de Recherche Opérationnelle. 1987.Using tabu search techniques for graph coloring
Computing. 1987. DOI : 10.1007/BF02239976.Four classes of perfectly orderable graphs
Journal of Graph Theory. 1987. DOI : 10.1002/jgt.3190110405.Network simplex method applied to AC load-flow calculation
IEEE Transactions on Power Systems. 1987. DOI : 10.1109/TPWRS.1987.4335100.Some experiments with simulated annealing
European Journal of Operational Research. 1987. DOI : 10.1016/S0377-2217(87)80148-0.Partitions into odd chains
Mathematical Programming. 1987. DOI : 10.1007/BF02591682.Reviews
S.K. Bhatnagar "Network analysis techniques" (Wiley, New Delhi, 1986)
European Journal of Operational Research. 1987. DOI : 10.1016/0377-2217(87)90286-4.Theses
Optimisation convexe dans les réseaux avec applications au trafic routier et à l'énergie électrique
Lausanne, EPFL, 1987. DOI : 10.5075/epfl-thesis-669.1986
Journal Articles
Node covering with odd chains
Journal of Graph Theory. 1986. DOI : 10.1002/jgt.3190100206.Generalized neighbourhoods and a class of perfectly orderable graphs
Discrete Applied Mathematics. 1986. DOI : 10.1016/0166-218X(86)90043-0.Variations on the integral decomposition property
Mathematical Programming Study. 1986.A note on superbrittle graphs
Discrete Mathematics. 1986. DOI : 10.1016/0012-365X(86)90097-X.Timetabling problems : should they be canonical ?
INFOR: Information Systems and Operational Research. 1986.Reviews
J. Koene "Minimal cost flow in processing networks: A primal approach" : CWI Tract 4 (Amsterdam, 1983)
European Journal of Operational Research. 1986. DOI : 10.1016/0377-2217(86)90075-5.Alan Gibbons: Algorithmic graph theory
European Journal of Operational Research. 1986. DOI : 10.1016/0377-2217(86)90177-3.1985
Journal Articles
The struction of a graph: Application toCN-free graphs
Combinatorica. 1985. DOI : 10.1007/bf02579377.Threshold characterization of graphs with Dilworth number two
Journal of Graph Theory. 1985. DOI : 10.1002/jgt.3190090207.An introduction to timetabling
European Journal of Operational Research. 1985. DOI : 10.1016/0377-2217(85)90167-5.The struction of a graph : application to CN-free graphs, N.V. R. Mahadev
Combinatorica. 1985.Graphs, hypergraphs and timetabling
Methods Operational Research (Verlag A. Hain, Königstein). 1985.Some uses of hypergraphs in timetabling
Asia-Pacific Journal of Operational Research. 1985.On split graphs of Dilworth number 2
Discrete Mathematics. 1985. DOI : 10.1016/0012-365X(85)90040-8.A note on strong perfectness of graphs
Mathematical Programming. 1985. DOI : 10.1007/BF02591953.Stability in CAN-free graphs
Journal of Combinatorial Theory. 1985. DOI : 10.1016/0095-8956(85)90089-9.On the multiplication of divisions
Networks. 1985. DOI : 10.1002/net.3230150110.Book Chapters
Graphs, networks and applications
Further developments in operational research; Pergamon Press Oxford, 1985. p. 76 - 95.Graphs, hypergraphs and timetabling
Methods Operational Research; Königstein: Verlag A. Hain, 1985. p. 201 - 215.1984
Journal Articles
Variation on a theorem of König
Discrete Mathematics. 1984. DOI : 10.1016/0012-365X(84)90015-3.Balanced optimisation problems
Operations Research Letters. 1984. DOI : 10.1016/0167-6377(84)90061-0.Preemptive scheduling, linear programming and network flows
SIAM Journal on Algebraic and Discrete Methods. 1984. DOI : 10.1137/0605003.On some properties of the struction of a graph
SIAM Journal on Algebraic and Discrete Methods. 1984. DOI : 10.1137/0605025.A decomposition property of polyhedra
Mathematical Programming. 1984. DOI : 10.1007/BF02591932.Conference Papers
Pseudo-Boolean functions and stability of graphs
1984. Workshop on Algebraic Structures in Operations Research. p. 83 - 98. DOI : 10.1016/S0304-0208(08)72955-4.Theses
Elaboration de systèmes informatisés pour l'organisation de tournées de distribution
Lausanne, EPFL, 1984. DOI : 10.5075/epfl-thesis-539.Book Chapters
Some min-max formulations for partitioning problems in graphs and hypergraphs
Graphs and hypergraphs, DGOR Operations Research Proceedings; Springer Verlag, 1984. p. 269 - 273.1983
Conference Papers
On the use of bichromatic interchanges
1983. International Colloquium on Graph Theory and Combinatorics, Marseille–Luminy. p. 639 - 646. DOI : 10.1016/S0304-0208(08)73444-3.Book Chapters
On the fuzzy faces of the COP domain
Methods operational research; Hain, Hastein: Althenäum, 1983. p. 213 - 216.1982
Journal Articles
Some experiments with a timetabling system
OR Spektrum. 1982.Chromatic optimisation : limitations, objectives, uses, references
European Journal of Operational Research. 1982. DOI : 10.1016/S0377-2217(82)80002-7.Obstructions for regular colorings
Journal of Combinatorial Theory B. 1982. DOI : 10.1016/0095-8956(82)90008-9.Minimizing irregularities in sports schedules using graph theory
Discrete Applied Mathematics. 1982. DOI : 10.1016/0166-218X(82)90042-7.Reviews
D. Klingman and J.M. Mulvey (Eds.) "Network models and associated applications" (Vol. 15 in: Mathematical Programming Studies. - North-Holland, Amsterdam, 1981)
European Journal of Operational Research. 1982. DOI : 10.1016/0377-2217(82)90233-8.J.L. Kennington and R.V. Helgason "Algorithms for network programming" (Wiley, New York, 1980)
European Journal of Operational Research. 1982. DOI : 10.1016/0377-2217(82)90081-9.1981
Journal Articles
Remarks on the requirement matrix of school timetable problems and regular embeddings of graphs
European Journal of Operational Research. 1981. DOI : 10.1016/0377-2217(81)90233-2.Remarks on the requirement matrix of school timetable problems
European Journal of Operational Research. 1981. DOI : 10.1016/0377-2217(81)90247-2.On the existence of generalized good and equitable colorings
Journal of Graph Theory. 1981. DOI : 10.1002/jgt.3190050306.On some characterisations of totally unimodular matrices
Mathematical Programming. 1981. DOI : 10.1007/BF01589329.Book Chapters
Scheduling in Sports
Studies on graphs and integer programming; North Holland: Annals of Discrete Mathematics, 1981. p. 381 - 395.1980
Journal Articles
A tutorial on heuristic methods
European Journal of Operational Research. 1980. DOI : 10.1016/0377-2217(80)90084-3.Geography, games and graphs
Discrete Applied Mathematics. 1980. DOI : 10.1016/0166-218X(80)90028-1.Reviews
Schrijver, A. (Ed.): Packing and Covering in Combinatorics (Amsterdam: Mathematisch Centrum 1979)
Operations-Research-Spektrum. 1980. DOI : 10.1007/bf01719342.Book Chapters
Some partitioning problems for graphs and hypergraphs
Proceedings V Symposium on Operations Research; 1980. p. 291 - 293.Fantaisies chromatiques sur diverses partitions
Regards sur la théorie des graphes; Presses Polytechniques Romandes, 1980. p. 217 - 226.Network flows and chromatic scheduling
Proceedings of DAPS; Uni of Copenhagen, 1980. p. 429 - 438.Optimisation in edge-chromatic scheduling
Survey of Mathematical Programming; Budapest: Akademiai Kiado, 1980. p. 379 - 382.1979
Journal Articles
Partial compactness in chromatic scheduling
Op. Res. Verfahren. 1979.Regular and canonical colorings
Discrete Mathematics. 1979. DOI : 10.1016/0012-365X(79)90165-1.On the use of alternating chains and hypergraphs in edge colorings
Journal of Graph Theory. 1979. DOI : 10.1002/jgt.3190030208.Book Chapters
On a class of hypergraphs occurring in chromatic scheduling
Cahiers du C.E.R.O.; 1979. p. 239 - 245.1978
Journal Articles
On line perfect graphs
Mathematical Programming. 1978. DOI : 10.1007/BF01609025.Color-feasible sequences of multigraphs
Networks. 1978. DOI : 10.1002/net.3230080105.Some comments on a note about timetabling
INFOR: Information Systems and Operational Research. 1978.Book Chapters
Color-feasible sequences in almost bipartite graphs
Problèmes combinatoires et théorie des graphes; Paris: Orsay - Editions CNRS, 1978. p. 427 - 429.1977
Journal Articles
Multigraphs with quasi-weak odd cycles
Journal of Combinatorial Theory, Series B. 1977. DOI : 10.1016/0095-8956(77)90058-2.Uniqueness of colorings
Archiv der Mathematik. 1977.Compactness and balancing in scheduling
Zeitschrift für Operations Research. 1977. DOI : 10.1007/BF01918457.Theses
Le problème de la répartition proportionnelle
Lausanne, EPFL, 1977. DOI : 10.5075/epfl-thesis-270.Book Chapters
Modélisation mathématique du recyclage des boues d'épuration comme engrais pour l'agriculture
Modélisation et maîtrise des systèmes techniques, économiques, sociaux, Actes du Congrès AFCET; Paris: Hommes et Techniques, 1977. p. 519 - 526.Progressive balancing in chromatic scheduling
Proceedings of Combinatorial Programming; Uni. of Liverpool, 1977. p. 105 - 113.On a multi-period assignment problem
Advances in operations research; North Holland, Amsterdam: Physica-Verlag, Würzburg, 1977. p. 129 - 134.Some coloring techniques
Studies in Integer Programming; 1977. p. 179 - 184.1976
Journal Articles
A note on a paper by D. Seinsche
Journal of Combinatorial Theory, Series B. 1976. DOI : 10.1016/0095-8956(76)90033-2.An extension of bipartite multigraphs
Discrete Mathematics. 1976. DOI : 10.1016/0012-365X(76)90056-X.Some remarks on good colorations
Journal of Combinatorial Theory, Series B. 1976. DOI : 10.1016/0095-8956(76)90027-7.Book Chapters
Everything you always wanted to know about S. Ex
Proceedings in Operation Research; Würzburg: Physica-Verlag, 1976. p. 104 - 107.Un modèle pour l'utilisation dans l'agriculture des boues produites par les stations d'épuration
Proceedings in Operation Research; Würzburg: Physica-Verlag, 1976.1975
Journal Articles
On a particular conference scheduling problem
INFOR: Information Systems and Operational Research. 1975.Book Chapters
How to color a graph
Combinatorial programming : methods and applications; Dordrecht, Netherlands: D. Reidel Publ. Co., 1975. p. 305 - 325.On good and equitable colorings
Cahiers du C.E.R.O.; 1975. p. 417 - 426.A few remarks on chromatic scheduling
Combinatorial programming : methods and applications; Dordrecht, Netherlands: D. Reidel Publ. Co., 1975. p. 337 - 342.1974
Journal Articles
A note on graph coloring
Revue française d'automatique, d'informatique et de recherche opérationnelle. 1974.Some results in chromatic scheduling
Zeitschrift für Op. Res.. 1974. DOI : 10.1007/BF02026597.Book Chapters
Partitions of graphs into coverings and hypergraphs into transversals
Commentarii mathematici Helvetici; 1974. p. 175 - 178.1972
Journal Articles
Decomposition of bipartite multigraphs into matchings
Zeitschrift für Op. Res.. 1972. DOI : 10.1007/BF01963619.1971
Journal Articles
Balanced schedules
INFOR: Information Systems and Operational Research. 1971. DOI : 10.1080/03155986.1971.11731479.Construction of school timetables by flow methods
INFOR: Information Systems and Operational Research. 1971.A property of minimum concave cost flows in capacitated networks
INFOR: Information Systems and Operational Research. 1971. DOI : 10.1080/03155986.1971.11731485.Investigations on an edge coloring problem
Discrete Mathematics. 1971. DOI : 10.1016/0012-365X(71)90022-7.Equitable colorations of graphs
Revue française d'informatique et de recherche opérationnelle. 1971. DOI : 10.1051/m2an/197105R300031.1970
Journal Articles
On some combinatorial problems arising in scheduling
CORS Journal. 1970.1969
Book Chapters
Résolution de problèmes d'horaires par la théorie des graphes
EPFL; 1969.Teaching & PhD
Past EPFL PhD Students
Andreas Rogger, David Schindl, Ivo Blöchliger, Tinaz Ekim, Bernard Ries, Benjamin Leroy-Beaulieu