VLDB 2026 Research / reviewers in the wild / expert

Kurt M. Anstreicher

dblp:70/3539 · DBLP profile ↗
← Back
12ranked-venue papers
10as first author
1since 2021 · last 2021
0000-0002-6306-9940ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 9 · 8 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author
YearPublicationVenuePosition
2021 Convex hull representations for bounded products of variables
Kurt M. Anstreicher, Samuel Burer, Kyungchan Park
 J. Glob. Optim.1
2018 Maximum-entropy sampling and the Boolean quadric polytope
Kurt M. Anstreicher
 J. Glob. Optim.1
2013 Geometric conditions for Euclidean Steiner trees in ℜd
Jon W. Van Laarhoven, Kurt M. Anstreicher
 Comput. Geom.2
2009 Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
Kurt M. Anstreicher
 J. Glob. Optim.1
2005 D.C. Versus Copositive Bounds for Standard QP
Kurt M. Anstreicher, Samuel Burer
 J. Glob. Optim.1
2004 The Thirteen Spheres: A New Proof
Kurt M. Anstreicher
 Discret. Comput. Geom.1
2002 Improved Linear Programming Bounds for Antipodal Spherical Codes
Kurt M. Anstreicher
 Discret. Comput. Geom.1
2001 Maximum-entropy remote sampling
Kurt M. Anstreicher, Marcia Helena Costa Fampa, Jon Lee 0001, Joy Williams
 Discret. Appl. Math.1
1996 Continuous Relaxations for Constrained Maximum-Entropy Sampling
Kurt M. Anstreicher, Marcia Helena Costa Fampa, Jon Lee 0001, Joy Williams
 IPCO1
1993 A Long-Step Barrier Method for Convex Quadratic Programming
Kurt M. Anstreicher, Dick den Hertog, Kees Roos, Tamás Terlaky
 Algorithmica1
1993 On Partial Updating in a Potential Reduction Linear Programming Algorithm of Kojima, Mizuno, and Yoshise
Robert A. Bosch, Kurt M. Anstreicher
 Algorithmica2
1986 A Monotonic Projective Algorithm for Fractional Linear Programming
Kurt M. Anstreicher
 Algorithmica1