| Theory of linear and integer programming A Schrijver John Wiley & Sons, 1998 | 11540 | 1998 |
| Combinatorial optimization: polyhedra and efficiency A Schrijver Springer 24 (2), 2003 | 6597 | 2003 |
| Geometric algorithms and combinatorial optimization M Grötschel, L Lovász, A Schrijver Springer Science & Business Media, 2012 | 5477 | 2012 |
| Combinatorial optimization WJ Cook, WH Cunningham, WR Pulleyblank, A Schrijver Unpublished manuscript 10, 75-93, 1994 | 3483 | 1994 |
| The ellipsoid method and its consequences in combinatorial optimization M Grötschel, L Lovász, A Schrijver Combinatorica 1, 169-197, 1981 | 2754 | 1981 |
| Cones of matrices and set-functions and 0–1 optimization L Lovász, A Schrijver SIAM journal on optimization 1 (2), 166-190, 1991 | 1281 | 1991 |
| Graph theory R Diestel Springer (print edition); Reinhard Diestel (eBooks), 2024 | 860 | 2024 |
| A combinatorial algorithm minimizing submodular functions in strongly polynomial time A Schrijver Journal of Combinatorial Theory, Series B 80 (2), 346-355, 2000 | 825 | 2000 |
| Polynomial algorithms for perfect graphs M Grötschel, L Lovász, A Schrijver North-Holland mathematics studies 88, 325-356, 1984 | 523 | 1984 |
| On the History of Combinatorial Optimization (till 1960) A Schrijver Handbook of Discrete Optimization/Elsevier, 2005 | 464 | 2005 |
| On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems CAJ Hurkens, A Schrijver SIAM Journal on Discrete Mathematics 2 (1), 68-72, 1989 | 347 | 1989 |
| Chvátal closures for mixed integer programming problems W Cook, R Kannan, A Schrijver Mathematical Programming 47 (1), 155-174, 1990 | 344 | 1990 |
| Matroids A Schrijver Combinatorial optimization: polyhedra and efficiency 24, 651-687, 2003 | 337* | 2003 |
| On the history of the transportation and maximum flow problems A Schrijver Mathematical programming 91, 437-445, 2002 | 331 | 2002 |
| A comparison of the Delsarte and Lovász bounds A Schrijver IEEE Transactions on Information Theory 25 (4), 425-429, 1979 | 307 | 1979 |
| A rolling stock circulation model for combining and splitting of passenger trains PJ Fioole, L Kroon, G Maróti, A Schrijver European Journal of Operational Research 174 (2), 1281-1297, 2006 | 277 | 2006 |
| The new Dutch timetable: The OR revolution L Kroon, D Huisman, E Abbink, PJ Fioole, M Fischetti, G Maróti, ... Interfaces 39 (1), 6-17, 2009 | 271 | 2009 |
| Sensitivity theorems in integer linear programming W Cook, AMH Gerards, A Schrijver, É Tardos Mathematical Programming 34, 251-264, 1986 | 271 | 1986 |
| New code upper bounds from the Terwilliger algebra and semidefinite programming A Schrijver IEEE Transactions on Information Theory 51 (8), 2859-2866, 2005 | 261 | 2005 |
| Reflection positivity, rank connectivity, and homomorphism of graphs M Freedman, L Lovász, A Schrijver Journal of the American Mathematical Society 20 (1), 37-51, 2007 | 221 | 2007 |
