A. Schrijver

CUTTING PLANE ALGORITHMS FOR INTEGER PROGRAMMING, (2008)

Given a symmetric n x n matrix A, we define, for any graph G, f(A)(G) := Sigma(phi:VG ->[1,...,n]) Pi(uv is an element of EG) a(phi(u),phi(v).) We characterize for which graph parameters f there is a...

Cutting Plane Algorithms, M. Jünger, L. Wolsey, A. Schrijver, R. E. Gomory

Cutting plane methods are exact algorithms for integer programming problems. Theyhave proven to be very useful computationally in the last few years, especially when combined with a branch and bound...

and Time-Space Tradeoffs (2008)

Lower Bounds, Lower Bounds, Lower Bounds, Academisch Proefschrift, Prof. Dr. A. Schrijver, Bruce Lee

ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam op gezag van de Rector Magnificus prof.mr. P.F. van der Heijden ten overstaan van een door het college voor promoties...

Tensor subalgebras and First Fundamental Theorems in invariant theory (2008)

Graph parameters and semigroup functions (2008)

Let V be an n-dimensional complex inner product space and let T := T(V) circle times T(V*) be the mixed tensor algebra over V. We characterize those subsets A of T for which there is a subgroup G of...

Lovász, L., Schrijver, A.

We prove a general theorem on semigroup functions that implies characterizations of graph partition functions in terms of the positive semidefiniteness (‘reflection positivity’) and rank of...

Reduction of symmetric semidefinite programs using the regular*-representation (2007)

Reflection positivity, rank connectivity, and homomorphism of graphs (2007)

Freedman, M.H., LovÃ¡sz, L., Schrijver, A.

Abstract: It is shown that a graph parameter can be realized as the number of homomorphisms into a fixed (weighted) graph if and only if it satisfies two linear algebraic conditions: reflection...

Reduction of symmetric semidefinite programs using the regular *-representation (2007)

Reflection positivity, rank connectivity, and homomorphism of graphs (2007)

Abstract We consider semidefinite programming problems on which a permutation group is acting. We describe a general technique to reduce the size of such problems, exploiting the symmetry. The...

Freedman, M.H., Lovász, L., Schrijver, A.

Abstract: It is shown that a graph parameter can be realized as the number of homomorphisms into a fixed (weighted) graph if and only if it satisfies two linear algebraic conditions: reflection...

Reduction of symmetric semidefinite programs using the regular *-representation (2007)

Leven lang duurzaam praktijkgericht netwerk leren (2007)

Abstract We consider semidefinite programming problems on which a permutation group is acting. We describe a general technique to reduce the size of such problems, exploiting the symmetry. The...

Hassink, E., Schrijver, A., Vernooij, J., Bakhuis, H., Grijsen, L.

Wat kunnen we berekenen? (2006)

New Upper Bounds for Nonbinary Codes Based on the Terwilliger Algebra and Semidefinite Programming (2006)

Onopgeloste grote vragen zijn de drijfveren voor de wetenschap. Ter gelegenheid van zijn 125-jarig bestaan heeft het tijdschrift Science 125 grote wetenschappelijke mysteries geformuleerd. De K.L....

Gijswijt, D.C., Schrijver, A.

Abstract: We give a new upper bound on the maximum size $A_q(n,d)$ of a code of word length $n$ and minimum Hamming distance at least $d$ over the alphabet of $q\geq 3$ letters. By...

Wiskunde gezever? (2006)

A rolling stock circulation model for combining and splitting of passenger trains (2006)

column

Fioole, P.J., Kroon, L.G., Maróti, G., Schrijver, A.

Abstract This paper addresses the railway rolling stock circulation problem. Given the departure and arrival times as well as the expected numbers of passengers, we have to assign the rolling stock...

New limits on fault-tolerant quantum computation (2006)

Buhrman, H.M., Cleve, R., Laurent, M., Linden, N., Schrijver, A., Unger, F.P.

We show that quantum circuits cannot be made fault-tolerant against a depolarizing noise level of approximately 45%, thereby improving on a previous bound of 50% (due to Razborov). Our precise...

Efficient Circulation of Railway Rolling Stock (2006)

Alfieri, A., Groot, R., Kroon, L.G., Schrijver, A.

Railway rolling stock (locomotives, carriages, and train units) is one of the most significant cost sources for operatorsof passenger trains, both public and private. Rolling stock costsare due to...

Operations Research Techniques In Constraint Programming (2005)

Willem Jan Van Hoeve, Academisch Proefschrift, Prof. Dr. A. Schrijver, Dr. M. Laurent, Dr. M. Milano, Dr. L. Torenvliet

this paper a semidefinite relaxation is used rather than a linear relaxation. For some problems, for example for the stable set problem, standard linear relaxations are not very tight and not...

Reflection positivity, rank connectivity, and homomorphism of graphs (2004)

Freedman, M., Lovasz, L., Schrijver, A.

It is shown that a graph parameter can be realized as the number of homomorphisms into a fixed (weighted) graph if and only if it satisfies two linear algebraic conditions: reflection positivity and...

Combinatorial optimization. Polyhedra and efficiency. (2003)

Matching, edge-colouring, dimers (2003)

Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "A generalization of the perfect graph theorem under the disjunctive index'' (2003)

Gerards, A.H., Maroti, G., Schrijver, A.

Blocking nonorientability of a surface (2003)

Mohar, B., Schrijver, A.

On the b-stable set polytope of graphs without bad K-4 (2003)

Gijswijt, D.C., Schrijver, A.

A Course in Combinatorial Optimization (2003)

Alexander Schrijver, Plantage Muidergracht, A. Schrijver

Contents 1. Shortest paths and trees 4 1.1. Shortest paths with nonnegative lengths 4 1.2. Speeding up Dijkstra's algorithm with heaps 6 1.3. Shortest paths with arbitrary lengths 9 1.4. Minimum...

On the history of the transportation and the maximum flow problems (2002)

A short proof of Guenin's characterization of weakly bipartite graphs (2002)

Strong t-perfection of bad K-4 graphs. (2002)

A short proof of Mader's S-paths theorem (2001)

Quantum Computing and Communication Complexity (2001)

Ronald De Wolf, Academisch Proefschrift, Promotores Prof. Dr, H. M. Buhrman, Overige Prof. Dr, R. E. Cleve, ...

ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam op gezag van de Rector Magnificus prof.dr. J.J.M. Franse ten overstaan van een door het college voor promoties ingestelde...

A combinatorial algorithm minimizing submodular functions in strongly polynomial time (2000)

Total dual integrality of matching forest constraints (2000)

Equilateral dimension of the rectilinear space (2000)

Koolen, J., Laurent, M., Schrijver, A.

Adjacency, inseparability, and base orderability in matroids (2000)

Keijsper, J.C.M., Pendavingh, R.A., Schrijver, A.

The Colin de Verdiere graph parameter (1999)

Holst, H. Van Der, Lovasz, L., Schrijver, A.

The compact dynamic bus station (1999)

Vlijmen, S.F.M. Van, Klusener, S., Schrijver, A.

Bipartite edge-colouring in O (delta m) time (1999)

On the null space of a Colin de Verdiere matrix (1999)

Lovasz, L., Schrijver, A.

The ring loading problem (1999)

Schrijver, A., Seymour, P.D., Winkler, P.

The Colin de Verdiere parameter (1999)

Holst, H. Van Der, Lovasz, L., Schrijver, A.

The compact dynamic busstation (1999)

Vlijmen, S.F.M. Van, Klusener, A.S., Schrijver, A.

Bipartite edge-colouring in $O (\Delta m) $ time (1999)

On the null space of a Colin de Verdiere matrix (1999)

Lovasz, L., Schrijver, A.

Bipartite edge-colouring in $O(\Delta m)$ time (1998)

Counting 1-factors in regular bipartite graphs (1998)

Routing and timetabling by topological search (1998)

A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs (1998)

Lovasz, L., Schrijver, A.

On packing connectors (1998)

Keijsper, J.C.M., Schrijver, A.

Minor-monotone graph invariants (1997)

Decomposition of graphs on surfaces (1997)

Making curves minimally crossing by Reidemeister moves (1997)

A minor-monotone graph parameter based on oriented matroids (1997)

Edmonds, J., Laurent, M., Schrijver, A.

Minor-monotone graph invariants. (1997)

Decomposition of graphs on surfaces. (1997)

Making curves minimally crossing by Reidemeister moves. (1997)

A minor-monotone graph parameter based on oriented matroids. (1997)

Edmonds, J., Laurent, M., Schrijver, A.

A Note on Packing Connectors (1997)

J. Keijsper, A. Schrijver

Given an undirected graph G = (V; E) and a partition fS; Tg of V , an S-T connector is a set of edges F ` E such that every component of the subgraph (V; F ) intersects both S and T . We show that G...

Compact dynamisch busstation (1996)

Klusener, A.S., Vlijmen, S.F.M. Van, Schrijver, A.

Compact dynamic busstation (1996)

Schrijver, A., Klusener, A.S., Vlijmen, S.F.M. Van

Compact Dynamisch Busstation (1996)

A.S. Klusener, S.F.M. Van Vlijmen, A. Schrijver, Issn -x, Mathematisch Centrum (smc, The Dutch Foundation, ...

In opdracht van Nederland Haarlem hebben de Universiteit Utrecht (UU) en het Centrum voor Wiskunde en Informatica (CWI) een studie gemaakt naar het ontwerp van een Compact Dynamisch Busstation (CDB)....

Polyhedral combinatorics (1995)

On the invariance of Colin de Verdiere's graph parameter under clique sums (1995)

Holst, H. Van Der, Lovasz, L., Schrijver, A.

Characterizing homotopy of systems of curves on a compact surface by crossing numbers (1995)

On a minor-monotone graph invariant (1995)

Holst, H. Van Der, Laurent, M., Schrijver, A.

Characterizing homotopy of systems of curves on a compact surface by crossing numbers (1995)

Schrijver, A., Graaf, M. De

Paths in graphs and curves on surfaces (1994)

From Universal Morphisms to Megabytes: A Baayen Space Odyssey (1994)

Apt, K.R., Schrijver, A., Temme, N.

Rambling along paths, flows, trees, curves, knots, and rails (1994)

Schrijver, A., Seymour, P.D.

Packing odd paths (1994)

Finding k disjoint paths in a directed planar graph (1994)

Classification of minimal graphs of given face-width on the torus (1994)

Grid minors of graphs on the torus (1994)

Induced circuits in planar graphs (1994)

McDiarmid, C., Reed, B., Schrijver, A., Shepherd, B.

Non-interfering network flows (1993)

McDiarmid, Colin, Reed, B., Schrijver, A., Shepherd, B.

Cones of matrices and set-functions and 0-1 optimization (1991)

L. Lovász, A. Schrijver

Abstract. It has been recognized recently that to represent a polyhedron as the projection of a higher dimensional, but simpler, polyhedron, is a powerful tool in polyhedral combinatorics. We develop...

Edge-disjoint homotopic paths in a planar graph with one hole (1990)

Hoesel, C. Van, Schrijver, A.

Signed graphs - regular matroids - grafts (1986)

Gerards, A.M.H., Schrijver, A.

CO~ATO~CA 6 (4) (1986) 365~379 MATRICES WITH THE EDMONDS--JOHNSON PROPERTY (1984)

A. M. H. Gerards, A. Schrijver

A matrix A = (a~j) has the Edmonds--Johnson property if, for each choice of integral vec-tors dl, d,., b~, b~, the convex hull of the integral solutions of dt~-x~-d2, bt~-Ax~-b. ~ is obtained by...

Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields (1981)

Lint, JH Van, Schrijver, A

Matroids and linking systems / (1977)

Efficient Circulation of Railway Rolling Stock

Thesis--Vrije Universiteit, Amsterdam.

Alfieri, A., Groot, R., Kroon, L.G., Schrijver, A.

Railway rolling stock (locomotives, carriages, and train units) is one of the most significant cost sources for operatorsof passenger trains, both public and private. Rolling stock costsare due to...

Shunting of Passenger Train Units: an Integrated Approach

Kroon, L.G., Lentink, R.M., Schrijver, A.

In this paper, we describe a new model for the Train Unit Shunting Problem. This model is capable of solving the matching and parking subproblems in an integrated manner, usually requiring a...

The new Dutch timetable: The OR revolution

Kroon, L.G., Huisman, D., Abbink, E.J.W., Fioole, P-J., Fischetti, M., Maroti, G., ...

In December 2006, Netherlands Railways introduced a completely new timetable. Its objective was to facilitate the growth of passenger and freight transport on a highly utilized railway network, and...

Reduction of symmetric semidefinite programs using the regular*-representation.