Alexander Schrijver
Alexander Schrijver
University of Amsterdam and CWI
Bestätigte E-Mail-Adresse bei cwi.nl - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Theory of linear and integer programming
A Schrijver
John Wiley & Sons, 1998
99831998
Combinatorial optimization: polyhedra and efficiency
A Schrijver
Springer Science & Business Media, 2003
54272003
Geometric algorithms and combinatorial optimization
M Grötschel, L Lovász, A Schrijver
Springer Science & Business Media, 2012
48272012
The ellipsoid method and its consequences in combinatorial optimization
M Grötschel, L Lovász, A Schrijver
Combinatorica 1 (2), 169-197, 1981
24221981
Combinatorial optimization: papers from the DIMACS Special Year
W Cook, L Lovász, PD Seymour
American Mathematical Soc., 1995
16691995
Cones of matrices and set-functions and 0–1 optimization
L Lovász, A Schrijver
SIAM journal on optimization 1 (2), 166-190, 1991
11961991
Graph theory
R Diestel, A Schrijver, PD Seymour
MATHEMATISCHES FORSCHUNGSINSTITUT OBERWOLFACH REPORT NO. 16/2007, 2007
902*2007
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
A Schrijver
Journal of Combinatorial Theory, Series B 80 (2), 346-355, 2000
7242000
Polynomial algorithms for perfect graphs
M Grötschel, L Lovász, A Schrijver
North-Holland mathematics studies 88, 325-356, 1984
4471984
Theory of linear and integer programming. Interscience series in discrete mathematics and optimization
A Schrijver
Wiley, New York, 1986
4461986
On the history of combinatorial optimization (till 1960)
A Schrijver
Handbooks in operations research and management science 12, 1-68, 2005
3382005
Chvátal closures for mixed integer programming problems
W Cook, R Kannan, A Schrijver
Mathematical Programming 47 (1), 155-174, 1990
3221990
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
3091989
Combinatorial Optimization Polyhedra and Efficiency Volume A Paths, Flows, Matchings Chapters 1-38
A Schrijver
Algorithms and Combinatorics 24 (1), ALL-ALL, 2003
308*2003
Graduate Texts in Mathematics, Volume 173
R Diestel
Springer-Verlag New York, Incorporated, 2000
2642000
On the history of the transportation and maximum flow problems
A Schrijver
Mathematical programming 91 (3), 437-445, 2002
2602002
A comparison of the Delsarte and Lovász bounds
A Schrijver
IEEE Transactions on Information Theory 25 (4), 425-429, 1979
2461979
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
2202009
Sensitivity theorems in integer linear programming
W Cook, AMH Gerards, A Schrijver, É Tardos
Mathematical Programming 34 (3), 251-264, 1986
2181986
New code upper bounds from the Terwilliger algebra and semidefinite programming
A Schrijver
IEEE Transactions on Information Theory 51 (8), 2859-2866, 2005
2082005
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20