Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,218,373 papers from all fields of science
Search
Sign In
Create Free Account
Alexander Schrijver
Known as:
Lex Schrijver
, Schrijver
Alexander (Lex) Schrijver (born 4 May 1948 in Amsterdam) is a Dutch mathematician and computer scientist, a professor of discrete mathematics and…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Bland's rule
Blossom algorithm
Combinatorial optimization
Combinatorica
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
The minimal solar activity in 2008–2009 and its implications for long‐term climate modeling
C. Schrijver
,
W. Livingston
,
T. Woods
,
R. Mewaldt
2011
Corpus ID: 5479606
Variations in the total solar irradiance (TSI) associated with solar activity have been argued to influence the Earth's climate…
Expand
Highly Cited
2007
Highly Cited
2007
Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations
E. Chlamtác
IEEE Annual Symposium on Foundations of Computer…
2007
Corpus ID: 1479175
We. introduce, a framework for studying semidefiniie programming (SOP) relaxations based on the Lasserre hierarchy in the context…
Expand
2005
2005
Contractors and connectors of graph algebras
L. Lovász
,
Balázs Szegedy
Journal of Graph Theory
2005
Corpus ID: 10114717
We study generalizations of the “contraction‐deletion” relation of the Tutte polynomial, and other similar simple operations, to…
Expand
Highly Cited
2005
Highly Cited
2005
Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications
L. Gurvits
Symposium on the Theory of Computing
2005
Corpus ID: 9679748
Let p(x<sub>1</sub>,...,x<sub>n</sub>) = p(X) , X ∈ R<sup>n</sup> be a homogeneous polynomial of degree n in n real variables, e…
Expand
2005
2005
Simple lifted cover inequalities and hard knapsack problems
Brady Hunsaker
,
C. Tovey
Discrete Optimization
2005
Corpus ID: 11740027
Highly Cited
2003
Highly Cited
2003
On the separation of split cuts and related inequalities
A. Caprara
,
Adam N. Letchford
Mathematical programming
2003
Corpus ID: 2076826
Abstract. The split cuts of Cook, Kannan and Schrijver are general-purpose valid inequalities for integer programming which…
Expand
2002
2002
Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lov[a-acute]sz--Schrijver Lift-and-Project Procedure
M. Laurent
SIAM Journal on Optimization
2002
Corpus ID: 6513145
We study how the lift-and-project method introduced by Lovasz and Schrijver [SIAM J. Optim., 1 (1991), pp. 166--190] applies to…
Expand
Highly Cited
2002
Highly Cited
2002
Split closure and intersection cuts
K. Andersen
,
G. Cornuéjols
,
Yanjun Li
Mathematical programming
2002
Corpus ID: 2148456
Abstract.In the seventies, Balas introduced intersection cuts for a Mixed Integer Linear Program (MILP), and showed that these…
Expand
Highly Cited
2001
Highly Cited
2001
On the Rank of Mixed 0, 1 Polyhedra
G. Cornuéjols
,
Yanjun Li
Conference on Integer Programming and…
2001
Corpus ID: 8248867
Eisenbrand and Schulz showed recently (IPCO 99) that the maximum Chvatal rank of a polytope in the [0, 1]n cube is bounded above…
Expand
Highly Cited
1986
Highly Cited
1986
Blocking sets in desarguesian projective planes
A. Blokhuis
,
A. Brouwer
1986
Corpus ID: 120551265
Using theorems of Redei, and of Brouwer and Schrijver, and Jamison, it is proved that a non-trivial blocking set in a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE