Schrijver, A.
Overview
Works:  110 works in 480 publications in 5 languages and 4,033 library holdings 

Roles:  Author, Editor, Creator, Contributor, Thesis advisor, 958 
Classifications:  T57.74, 511.6 
Publication Timeline
.
Most widely held works by
A Schrijver
Theory of linear and integer programming by
A Schrijver(
Book
)
57 editions published between 1986 and 2011 in English and held by 806 WorldCat member libraries worldwide
Als Ergänzung zu den mehr praxisorientierten Büchern, die auf dem Gebiet der linearen und Integerprogrammierung bereits erschienen sind, beschreibt dieses Werk die zugrunde liegende Theorie und gibt einen Überblick über wichtige Algorithmen. Der Autor diskutiert auch Anwendungen auf die kombinatorische Optimierung; neben einer ausführlichen Bibliographie finden sich umfangreiche historische Anmerkungen. Theory of Linear and Integer Programming Alexander Schrijver Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands This book describes the theory of linear and integer programming and surveys the algorithms for linear and integer programming problems, focusing on complexity analysis. It aims at complementing the more practically oriented books in this field. A special feature is the author's coverage of important recent developments in linear and integer programming. Applications to combinatorial optimization are given, and the author also includes extensive historical surveys and bibliographies. The book is intended for graduate students and researchers in operations research, mathematics and computer science. It will also be of interest to mathematical historians
57 editions published between 1986 and 2011 in English and held by 806 WorldCat member libraries worldwide
Als Ergänzung zu den mehr praxisorientierten Büchern, die auf dem Gebiet der linearen und Integerprogrammierung bereits erschienen sind, beschreibt dieses Werk die zugrunde liegende Theorie und gibt einen Überblick über wichtige Algorithmen. Der Autor diskutiert auch Anwendungen auf die kombinatorische Optimierung; neben einer ausführlichen Bibliographie finden sich umfangreiche historische Anmerkungen. Theory of Linear and Integer Programming Alexander Schrijver Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands This book describes the theory of linear and integer programming and surveys the algorithms for linear and integer programming problems, focusing on complexity analysis. It aims at complementing the more practically oriented books in this field. A special feature is the author's coverage of important recent developments in linear and integer programming. Applications to combinatorial optimization are given, and the author also includes extensive historical surveys and bibliographies. The book is intended for graduate students and researchers in operations research, mathematics and computer science. It will also be of interest to mathematical historians
Combinatorial optimization : polyhedra and efficiency by
A Schrijver(
Book
)
73 editions published between 2003 and 2004 in 4 languages and held by 700 WorldCat member libraries worldwide
"This [electronic] book offers an indepth overview of polyhedral methods and efficient algorithms in combinatorial optimization. These techniques form a powerful, coherent, and unifying kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming, and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4500 references to further research are given, and historical surveys on the basic subjects are presented"Container
73 editions published between 2003 and 2004 in 4 languages and held by 700 WorldCat member libraries worldwide
"This [electronic] book offers an indepth overview of polyhedral methods and efficient algorithms in combinatorial optimization. These techniques form a powerful, coherent, and unifying kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming, and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4500 references to further research are given, and historical surveys on the basic subjects are presented"Container
Geometric algorithms and combinatorial optimization by
Martin Grötschel(
Book
)
35 editions published between 1980 and 1994 in English and German and held by 613 WorldCat member libraries worldwide
This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and  in particular  combinatorial optimization. It offers a unifying approach based on two fundamental geometric algorithms:  the ellipsoid method for finding a point in a convex set and  the basis reduction method for point lattices. The ellipsoid method was used by Khachiyan to show the polynomial time solvability of linear programming. The basis reduction method yields a polynomial time procedure for certain diophantine approximation problems. A combination of these techniques makes it possible to show the polynomial time solvability of many questions concerning poyhedra  for instance, of linear programming problems having possibly exponentially many inequalities. Utilizing results from polyhedral combinatorics, it provides short proofs of the poynomial time solvability of many combinatiorial optimization problems. For a number of these problems, the geometric algorithms discussed in this book are the only techniques known to derive polynomial time solvability. This book is a continuation and extension of previous research of the authors for which they received the Fulkerson Prize, awarded by the Mathematical Programming Society and the American Mathematical Society
35 editions published between 1980 and 1994 in English and German and held by 613 WorldCat member libraries worldwide
This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and  in particular  combinatorial optimization. It offers a unifying approach based on two fundamental geometric algorithms:  the ellipsoid method for finding a point in a convex set and  the basis reduction method for point lattices. The ellipsoid method was used by Khachiyan to show the polynomial time solvability of linear programming. The basis reduction method yields a polynomial time procedure for certain diophantine approximation problems. A combination of these techniques makes it possible to show the polynomial time solvability of many questions concerning poyhedra  for instance, of linear programming problems having possibly exponentially many inequalities. Utilizing results from polyhedral combinatorics, it provides short proofs of the poynomial time solvability of many combinatiorial optimization problems. For a number of these problems, the geometric algorithms discussed in this book are the only techniques known to derive polynomial time solvability. This book is a continuation and extension of previous research of the authors for which they received the Fulkerson Prize, awarded by the Mathematical Programming Society and the American Mathematical Society
Packing and covering in combinatorics(
Book
)
18 editions published between 1979 and 1982 in English and held by 182 WorldCat member libraries worldwide
18 editions published between 1979 and 1982 in English and held by 182 WorldCat member libraries worldwide
History of mathematical programming : a collection of personal reminiscences(
Book
)
5 editions published in 1991 in English and held by 161 WorldCat member libraries worldwide
5 editions published in 1991 in English and held by 161 WorldCat member libraries worldwide
Matroids and linking systems by
A Schrijver(
Book
)
15 editions published between 1977 and 1978 in English and Dutch and held by 159 WorldCat member libraries worldwide
15 editions published between 1977 and 1978 in English and Dutch and held by 159 WorldCat member libraries worldwide
Fete of combinatorics and computer science by
G Katona(
Book
)
11 editions published in 2010 in English and held by 40 WorldCat member libraries worldwide
Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is László Lovász, whose outstanding scientific work has defined and shaped many research directions in the past 40 years. A number of friends and colleagues, all top authorities in their fields of expertise gathered at the two conferences in August 2008 in Hungary, celebrating Lovász' 60th birthday. It was a real fete of combinatorics and computer science. Some of these plenary speakers submitted their research or survey papers prior to the conferences. These are included in the volume "Building Bridges". The other speakers were able to finish their contribution only later, these are collected in the present volume
11 editions published in 2010 in English and held by 40 WorldCat member libraries worldwide
Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is László Lovász, whose outstanding scientific work has defined and shaped many research directions in the past 40 years. A number of friends and colleagues, all top authorities in their fields of expertise gathered at the two conferences in August 2008 in Hungary, celebrating Lovász' 60th birthday. It was a real fete of combinatorics and computer science. Some of these plenary speakers submitted their research or survey papers prior to the conferences. These are included in the volume "Building Bridges". The other speakers were able to finish their contribution only later, these are collected in the present volume
Recherche opérationnelle [Journée annuelle, Société Mathématique de France 2004] by
Philippe Baptiste(
Book
)
4 editions published between 2003 and 2004 in French and held by 15 WorldCat member libraries worldwide
4 editions published between 2003 and 2004 in French and held by 15 WorldCat member libraries worldwide
Polyhedral combinatorics : some recent developments and results by
A Schrijver(
Book
)
10 editions published between 1986 and 1987 in English and Dutch and held by 11 WorldCat member libraries worldwide
10 editions published between 1986 and 1987 in English and Dutch and held by 11 WorldCat member libraries worldwide
Combinatorial optimization : polyhedra and efficiency. Vol. C. Disjoint paths, hypergraphs, chapters 7083 by
A Schrijver(
Book
)
3 editions published in 2003 in English and held by 11 WorldCat member libraries worldwide
3 editions published in 2003 in English and held by 11 WorldCat member libraries worldwide
Linking systems by
A Schrijver(
Book
)
10 editions published between 1974 and 1975 in English and Undetermined and held by 10 WorldCat member libraries worldwide
10 editions published between 1974 and 1975 in English and Undetermined and held by 10 WorldCat member libraries worldwide
Matrices with the EdmondsJohnson property by
A. M. H Gerards(
Book
)
4 editions published in 1985 in German and English and held by 9 WorldCat member libraries worldwide
4 editions published in 1985 in German and English and held by 9 WorldCat member libraries worldwide
Combinatorial optimization by
A Schrijver(
Book
)
2 editions published in 2003 in English and held by 9 WorldCat member libraries worldwide
2 editions published in 2003 in English and held by 9 WorldCat member libraries worldwide
Graphs and supercompact spaces by
A Schrijver(
Book
)
4 editions published between 1974 and 1975 in English and held by 8 WorldCat member libraries worldwide
4 editions published between 1974 and 1975 in English and held by 8 WorldCat member libraries worldwide
Combinatorial optimization polyhedra and efficiency ; volume AC by
A Schrijver(
Book
)
1 edition published in 2004 in English and held by 8 WorldCat member libraries worldwide
1 edition published in 2004 in English and held by 8 WorldCat member libraries worldwide
Fete of Combinatorics and Computer Science : [This book is the second volume of mathematical papers to commemorate the 60th
birthday of László ('Laci ') Lovász on March 9, 2008 ... two conferences were organized, the first from 59 August 2008
in Budapest, and the second the week after, from 1115 August 2008 in Keszthely, at the borders of Lake Balaton. The first
meeting was baptized "Building Bridges  Between Mathematics and Computer Science", the second "Fete of Combinatorics and
Computer Science". These names also adorn the two volumes published to commemorate the celebrations.](
)
2 editions published in 2010 in English and held by 7 WorldCat member libraries worldwide
2 editions published in 2010 in English and held by 7 WorldCat member libraries worldwide
From universal morphisms to megabytes: a Baayen space odyssey : CWI, Amsterdam, 20 December 1994, on the occasion of the retirement
of Prof.dr. P. C. Baayen, from the Stichting Mathematisch Centrum(
Book
)
2 editions published in 1994 in English and held by 7 WorldCat member libraries worldwide
2 editions published in 1994 in English and held by 7 WorldCat member libraries worldwide
Each complete bipartite graph minus a matching is representable by line segments by
P. van Emde Boas(
Book
)
5 editions published in 1976 in English and held by 6 WorldCat member libraries worldwide
5 editions published in 1976 in English and held by 6 WorldCat member libraries worldwide
On fractional multicommodity flows and distance functions by
C. A. J Hurkens(
Book
)
5 editions published in 1986 in English and held by 6 WorldCat member libraries worldwide
5 editions published in 1986 in English and held by 6 WorldCat member libraries worldwide
Distances and cuts in planar graphs by
A Schrijver(
Book
)
5 editions published in 1986 in English and held by 6 WorldCat member libraries worldwide
5 editions published in 1986 in English and held by 6 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Lovász, László 1948 Honoree Author
 Grötschel, Martin Author
 Katona, G. Author Editor
 Szőnyi, T. Editor
 Lenstra, J. K.
 Rinnooy Kan, A. H. G. 1949
 Centrum voor Wiskunde en Informatica (Amsterdam, Netherlands) Department of Operations Research, Statistics, and System Theory
 Seymour, P. D.
 Stichting Mathematisch centrum, Amsterdam
 Sági, Gábor
Useful Links
Associated Subjects
Algorithms Combinatorial analysis Combinatorial geometry Combinatorial optimization Combinatorial packing and covering Computational complexity Computer science Computer scienceMathematics Convex sets Economics Geometry of numbers Graph theory Integer programming Linear programming Locally compact spaces Mathematical optimization Mathematics Matroids Network analysis (Planning) Number theory Polyhedra Programming (Mathematics) Representations of graphs
Alternative Names
Alexander Schrijver Mathematician
Alexander Schrijver niederländischer Mathematiker
Schrijver, A. 1948
Schrijver, Alexander
Schrijver, Alexander 1948
Schrijver, Lex 1948
Схрейвер, А
Схрейвер, А. (Александр)
Схрейвер, Александр
Languages
Covers