WorldCat Identities

Schrijver, A.

Overview
Works: 107 works in 526 publications in 6 languages and 4,163 library holdings
Roles: Author, Editor, Creator, Thesis advisor, 958, Contributor
Classifications: T57.74, 511.6
Publication Timeline
.
Most widely held works by A Schrijver
Theory of linear and integer programming by A Schrijver( Book )

58 editions published between 1986 and 2011 in English and held by 820 WorldCat member libraries worldwide

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
Geometric algorithms and combinatorial optimization by Martin Grötschel( Book )

35 editions published between 1980 and 1994 in English and German and held by 615 WorldCat member libraries worldwide

Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it seems that many of the new results build on the models, algorithms, and theorems presented here. For instance, the celebrated Dyer-Frieze-Kannan algorithm for approximating the volume of a convex body is based on the oracle model of convex bodies and uses the ellipsoid method as a preprocessing technique. The polynomial time equivalence of optimization, separation, and membership has become a commonly employed tool in the study of the complexity of combinatorial optimization problems and in the newly developing field of computational convexity. Implementations of the basis reduction algorithm can be found in various computer algebra software systems. On the other hand, several of the open problems discussed in the first edition are still unsolved. For example, there are still no combinatorial polynomial time algorithms known for minimizing a submodular function or finding a maximum clique in a perfect graph. Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient. In particular, it is not known how to adapt interior point methods to such linear programs
Combinatorial optimization : polyhedra and efficiency by A Schrijver( Book )

49 editions published in 2003 in English and Undetermined and held by 535 WorldCat member libraries worldwide

An in-depth overview of polyhedral methods and efficient algorithms incombinatorial optimization. These methods form a broad, coherent and powerful 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 4000 references to further research are given, and historical surveys on thebasic subjects are presented
Packing and covering in combinatorics( Book )

18 editions published between 1979 and 1982 in English and held by 181 WorldCat member libraries worldwide

Mathematical Centre tract ; 106
History of mathematical programming : a collection of personal reminiscences( Book )

6 editions published in 1991 in English and held by 165 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 158 WorldCat member libraries worldwide

Combinatorial optimization : polyhedra and efficiency by A Schrijver( Book )

21 editions published in 2003 in English and held by 110 WorldCat member libraries worldwide

Combinatorial optimization : polyhedra and efficiency by A Schrijver( Book )

15 editions published between 2003 and 2004 in English and German and held by 85 WorldCat member libraries worldwide

"This [electronic] book offers an in-depth 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
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
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 14 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

Combinatorial optimization : polyhedra and efficiency ; volume A-C by A Schrijver( Book )

3 editions published between 2003 and 2004 in English and German and held by 10 WorldCat member libraries worldwide

Graphs and supercompact spaces by A Schrijver( Book )

4 editions published between 1974 and 1975 in English and held by 9 WorldCat member libraries worldwide

Matrices with the Edmonds-Johnson property by Albertus M. H Gerards( Book )

4 editions published in 1985 in German and English and held by 9 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

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

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

Combinatorial optimization : polyhedra and efficiency by A Schrijver( Book )

1 edition published in 2003 in Swedish and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.60 (from 0.32 for Theory of ... to 0.98 for Combinator ...)

Combinatorial optimization : polyhedra and efficiencyCombinatorial optimization : polyhedra and efficiencyCombinatorial optimization : polyhedra and efficiency
Alternative Names
Alexander Schrijver Mathematician

Alexander Schrijver niederländischer Mathematiker

Schrijver, A. 1948-

Schrijver, Alexander

Schrijver, Alexander 1948-

Schrijver, Lex 1948-

Схрейвер, А

Схрейвер, А. (Александр)

Схрейвер, Александр

Languages
Covers
Combinatorial optimization : polyhedra and efficiencyCombinatorial optimization : polyhedra and efficiencyCombinatorial optimization : polyhedra and efficiencyFete of combinatorics and computer scienceCombinatorial optimization : polyhedra and efficiency ; volume A-CCombinatorial optimization : polyhedra and efficiency