Alexander (Lex) Schrijver (born 4 May 1948 in Amsterdam) [1] is a Dutch mathematician and computer scientist, a professor of discrete mathematics and optimization at the University of Amsterdam and a fellow at the Centrum Wiskunde & Informatica in Amsterdam. [2] Since 1993 he has been co-editor in chief of the journal Combinatorica . [2] [3]
Schrijver earned his Ph.D. in 1977 from the Vrije Universiteit in Amsterdam, under the supervision of Pieter Cornelis Baayen. [4] He worked for the Centrum Wiskunde & Informatica (under its former name as the Mathematisch Centrum) in pure mathematics from 1973 to 1979, and was a professor at Tilburg University from 1983 to 1989. In 1989 he rejoined the Centrum Wiskunde & Informatica, and in 1990 he also became a professor at the University of Amsterdam. In 2005, he stepped down from management at CWI and instead became a CWI Fellow. [2] [5]
Schrijver was one of the winners of the Delbert Ray Fulkerson Prize of the American Mathematical Society in 1982 for his work with Martin Grötschel and László Lovász on applications of the ellipsoid method to combinatorial optimization; he won the same prize in 2003 (shared with Satoru Iwata, Lisa Fleischer, and Satoru Fujishige) for showing submodular minimization to be strongly polynomial. [6] [7] [8] [9] [10] He won the INFORMS Frederick W. Lanchester Prize in 1986 for his book Theory of Linear and Integer Programming, and again in 2004 for his book Combinatorial Optimization: Polyhedra and Efficiency. He was an Invited Speaker of the International Congress of Mathematicians (ICM) in 1986 in Berkeley [11] and of the ICM in 1998 in Berlin. [12] In 2003, he won the George B. Dantzig Prize of the Mathematical Programming Society and SIAM for "deep and fundamental research contributions to discrete optimization". [10] In 2006, he was a joint winner of the INFORMS John von Neumann Theory Prize with Grötschel and Lovász for their work in combinatorial optimization, and in particular for their joint work in the book Geometric Algorithms and Combinatorial Optimization showing the polynomial-time equivalence of separation and optimization. [13] In 2008, his work with Adri Steenbeek on scheduling the Dutch train system was honored with INFORMS' Franz Edelman Award for Achievement in Operations Research and the Management Sciences. [14] [15] He won the SIGMA prize of the Dutch SURF foundation in 2008, for a mathematics education project. [16] In 2015 he won the EURO Gold Medal, the highest distinction within Operations Research in Europe.
In 2005 Schrijver won the Spinoza Prize of the NWO, the highest scientific award in the Netherlands, for his research in combinatorics and algorithms. [17] Later in the same year he became a Knight of the Order of the Netherlands Lion. [5] In 2002, Schrijver received an honorary doctorate from the University of Waterloo in Canada, and in 2011 he received another one from Eötvös Loránd University in Hungary. [14]
Schrijver became a member of the Royal Netherlands Academy of Arts and Sciences in 1995. [18] He became a corresponding member of the North Rhine-Westphalia Academy for Sciences and Arts in 2005, [19] joined the German Academy of Sciences Leopoldina in 2006, [20] and was elected to the Academia Europaea in 2008. [21] In 2012 he became a fellow of the American Mathematical Society. [22]
The John von Neumann Theory Prize of the Institute for Operations Research and the Management Sciences (INFORMS) is awarded annually to an individual who has made fundamental and sustained contributions to theory in operations research and the management sciences.
Geometry of numbers is the part of number theory which uses geometry for the study of algebraic numbers. Typically, a ring of algebraic integers is viewed as a lattice in and the study of these lattices provides fundamental information on algebraic numbers. Hermann Minkowski initiated this line of research at the age of 26 in his work The Geometry of Numbers.
The Centrum Wiskunde & Informatica is a research centre in the field of mathematics and theoretical computer science. It is part of the institutes organization of the Dutch Research Council (NWO) and is located at the Amsterdam Science Park. This institute is famous as the creation site of the programming language Python. It was a founding member of the European Research Consortium for Informatics and Mathematics (ERCIM).
The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at each (triennial) International Symposium of the MOS. Originally, the prizes were paid out of a memorial fund administered by the AMS that was established by friends of the late Delbert Ray Fulkerson to encourage mathematical excellence in the fields of research exemplified by his work. The prizes are now funded by an endowment administered by MPS.
László Lovász is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best known for his work in combinatorics, for which he was awarded the 2021 Abel Prize jointly with Avi Wigderson. He was the president of the International Mathematical Union from 2007 to 2010 and the president of the Hungarian Academy of Sciences from 2014 to 2020.
Jack R. Edmonds is an American-born and educated computer scientist and mathematician who lived and worked in Canada for much of his life. He has made fundamental contributions to the fields of combinatorial optimization, polyhedral combinatorics, discrete mathematics and the theory of computing. He was the recipient of the 1985 John von Neumann Theory Prize.
Hendrik Willem Lenstra Jr. is a Dutch mathematician.
Arjen Klaas Lenstra is a Dutch mathematician, cryptographer and computational number theorist. He is a professor emeritus from the École Polytechnique Fédérale de Lausanne (EPFL) where he headed of the Laboratory for Cryptologic Algorithms.
Combinatorica is an international journal of mathematics, publishing papers in the fields of combinatorics and computer science. It started in 1981, with László Babai and László Lovász as the editors-in-chief with Paul Erdős as honorary editor-in-chief. The current editors-in-chief are Imre Bárány and József Solymosi. The advisory board consists of Ronald Graham, Gyula O. H. Katona, Miklós Simonovits, Vera Sós, and Endre Szemerédi. It is published by the János Bolyai Mathematical Society and Springer Verlag.
András Frank is a Hungarian mathematician, working in combinatorics, especially in graph theory, and combinatorial optimisation. He is director of the Institute of Mathematics of the Faculty of Sciences of the Eötvös Loránd University, Budapest.
In graph theory, the Lovász number of a graph is a real number that is an upper bound on the Shannon capacity of the graph. It is also known as Lovász theta function and is commonly denoted by , using a script form of the Greek letter theta to contrast with the upright theta used for Shannon capacity. This quantity was first introduced by László Lovász in his 1979 paper On the Shannon Capacity of a Graph.
In mathematics, a submodular set function is a set function that, informally, describes the relationship between a set of inputs and an output, where adding more of one input has a decreasing additional benefit. The natural diminishing returns property which makes them suitable for many applications, including approximation algorithms, game theory and electrical networks. Recently, submodular functions have also found utility in several real world problems in machine learning and artificial intelligence, including automatic summarization, multi-document summarization, feature selection, active learning, sensor placement, image collection summarization and many other domains.
Jan Karel Lenstra is a Dutch mathematician and operations researcher, known for his work on scheduling algorithms, local search, and the travelling salesman problem.
William John Cook is an American operations researcher and mathematician, and Professor of Combinatorics and Optimization at the University of Waterloo.
Monique Laurent is a French computer scientist and mathematician who is an expert in mathematical optimization. She is a researcher at the Centrum Wiskunde & Informatica in Amsterdam where she is also a member of the Management Team. Laurent also holds a part-time position as a professor of econometrics and operations research at Tilburg University.
In graph theory, a line perfect graph is a graph whose line graph is a perfect graph. Equivalently, these are the graphs in which every odd-length simple cycle is a triangle.
In graph theory and circuit complexity, the Tardos function is a graph invariant introduced by Éva Tardos in 1988 that has the following properties:
Martin Grötschel is a German mathematician known for his research on combinatorial optimization, polyhedral combinatorics, and operations research. From 1991 to 2012 he was Vice President of the Zuse Institute Berlin (ZIB) and served from 2012 to 2015 as ZIB's President. From 2015 to 2020 he was President of the Berlin-Brandenburg Academy of Sciences and Humanities (BBAW).
Algorithms and Combinatorics is a book series in mathematics, and particularly in combinatorics and the design and analysis of algorithms. It is published by Springer Science+Business Media, and was founded in 1987.
In the theory of combinatorial optimization, submodular flow is a general class of optimization problems that includes as special cases the minimum-cost flow problem, matroid intersection, and the problem of computing a minimum-weight dijoin in a weighted directed graph. It was originally formulated by Jack Edmonds and Rick Giles, and can be solved in polynomial time.
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
