# Alexander Schrijver

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- ArXiv
- 2011

Let A ∈ Ωn be doubly-stochastic n × n matrix. Alexander Schrijver proved in 1998 the following remarkable inequality per(Ã) ≥ ∏ 1… (More)

Is this relevant?

2010

2010

- The American Mathematical Monthly
- 2010

We give a concise exposition of the elegant proof given recently by Leonid Gurvits for several lower bounds on permanents. 1… (More)

Is this relevant?

2009

2009

- Electr. J. Comb.
- 2009

Freedman, Lovász and Schrijver characterized graph parameters that can be represented as the (weighted) number of homomorphisms… (More)

Is this relevant?

2008

2008

- 2008

The Netherlands has an intricate network of railway tracks to connect its many closely situated cities. Recently, the railroad… (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- IPCO
- 2007

Let f : 2 → R be a non-decreasing submodular set function, and let (N, I) be a matroid. We consider the problem maxS∈I f(S). It… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- SIAM Journal on Optimization
- 2006

We propose a method for optimizing the lift-and-project relaxations of binary integer programs introduced by Lovász and Schrijver… (More)

Is this relevant?

Review

2005

Review

2005

- Oper. Res. Lett.
- 2005

This article reviews the book by Alexander Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, Springer, Berlin… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- J. ACM
- 2001

This paper presents a combinatorial polynomial-time algorithm for minimizing submodular functions, answering an open question… (More)

Is this relevant?

1998

1998

A BORSUK THEOREM FOR ANTIPODAL LINKS AND A SPECTRAL CHARACTERIZATION OF LINKLESSLY EMBEDDABLE GRAPHS

- 1998

For any undirected graph G, let μ(G) be the graph parameter introduced by Colin de Verdière. In this paper we show that μ(G) ≤ 4… (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Math. Program.
- 1993

We propose a cutting plane algorithm for mixed 0-1 programs based on a family of polyhedra which strengthen the usual LP… (More)

Is this relevant?