Publications Influence

Share This Author

Theory of linear and integer programming

- A. Schrijver
- MathematicsWiley-Interscience series in discrete mathematics…
- 1 December 1986

Introduction and Preliminaries. Problems, Algorithms, and Complexity. LINEAR ALGEBRA. Linear Algebra and Complexity. LATTICES AND LINEAR DIOPHANTINE EQUATIONS. Theory of Lattices and Linear… Expand

Combinatorial optimization. Polyhedra and efficiency.

- A. Schrijver
- Economics
- 2003

TLDR

Geometric Algorithms and Combinatorial Optimization

- M. Grötschel, L. Lovász, A. Schrijver
- MathematicsAlgorithms and Combinatorics
- 1988

0. Mathematical Preliminaries.- 0.1 Linear Algebra and Linear Programming.- Basic Notation.- Hulls, Independence, Dimension.- Eigenvalues, Positive Definite Matrices.- Vector Norms, Balls.- Matrix… Expand

Cones of Matrices and Set-Functions and 0-1 Optimization

- L. Lovász, A. Schrijver
- EconomicsSIAM J. Optim.
- 1991

A system, method, and apparatus for facilitating a self-organizing workforce of one or more workers through payment and recognition incentives, a set of configurable operating rules, and a set of… Expand

The ellipsoid method and its consequences in combinatorial optimization

- M. Grötschel, L. Lovász, A. Schrijver
- Mathematics, Computer ScienceComb.
- 1981

TLDR

Combinatorial optimization

- W. Cook, W. Cunningham, W. Pulleyblank, A. Schrijver
- Computer Science
- 12 November 1997

GRAPH LIMITS AND EXCHANGEABLE RANDOM GRAPHS

- V. Sós, B. Szegedy, C. Borgs, J. Chayes, K. Vesztergombi, A. Schrijver
- Mathematics
- 2008

We develop a clear connection between de Finetti’s theorem for exchangeable arrays (work of Aldous–Hoover–Kallenberg) and the emerging area of graph limits (work of Lovász and many coauthors). Along… Expand

A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time

- A. Schrijver
- Mathematics, Computer ScienceJ. Comb. Theory, Ser. B
- 1 November 2000

We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear programming method.… Expand

Chvátal closures for mixed integer programming problems

- W. Cook, R. Kannan, A. Schrijver
- MathematicsMath. Program.
- 1 June 1990

TLDR

Vertex-critical subgraphs of Kneser-graphs

- A. Schrijver
- Mathematics
- 1978

We show that if the stable (independent) n-subsets of a circuit wit 2n+k vertices are split into k+1 classes, one of the classes contains two disjoint n-subsets; this yields a (k+2)-vertex-critical… Expand

...

1

2

3

4

5

...