Matthias Koeppe
Matthias Koeppe
Professor of Mathematics, UC Davis
Verified email at - Homepage
Cited by
Cited by
The Sage Mathematics Software System (Version 9.3)
The Sage Developers, 0
Nonlinear integer programming
R Hemmecke, M Köppe, J Lee, R Weismantel
50 Years of Integer Programming 1958-2008, 561-618, 2010
Algebraic and geometric ideas in the theory of discrete optimization
JA De Loera, R Hemmecke, M Köppe
SIAM, 2013
How to integrate a polynomial over a simplex
V Baldoni, N Berline, J De Loera, M Köppe, M Vergne
Mathematics of Computation 80 (273), 297-325, 2011
Software for exact integration of polynomials over polyhedra
JA De Loera, B Dutra, M Koeppe, S Moreinis, G Pinto, J Wu
Computational Geometry 46 (3), 232-252, 2013
Parametric integer programming algorithm for bilevel mixed integer programs
M Köppe, M Queyranne, CT Ryan
Journal of optimization theory and applications 146 (1), 137-150, 2010
Computing parametric rational generating functions with a primal Barvinok algorithm
M Köppe, S Verdoolaege
arXiv preprint arXiv:0705.3651, 2007
A primal Barvinok algorithm based on irrational decompositions
M Köppe
SIAM Journal on Discrete Mathematics 21 (1), 220-236, 2007
On the complexity of nonlinear mixed-integer optimization
M Köppe
Mixed Integer Nonlinear Programming, 533-557, 2011
A user’s guide for LattE integrale v1. 7.3, 2015
V Baldoni, N Berline, JA De Loera, B Dutra, M Köppe, S Moreinis, G Pinto, ...
Software package. LattE is available at http://www. math. ucdavis. edu/~ latte, 0
Integer polynomial optimization in fixed dimension
JA De Loera, R Hemmecke, M Köppe, R Weismantel
Mathematics of Operations Research 31 (1), 147-153, 2006
SBROME: a scalable optimization and module matching framework for automated biosystems design
L Huynh, A Tsoukalas, M Köppe, I Tagkopoulos
ACS synthetic biology 2 (5), 263-273, 2013
Intermediate sums on polyhedra: computation and real Ehrhart theory
V Baldoni, N Berline, M Köppe, M Vergne
Mathematika 59 (1), 1-22, 2013
A new Lenstra-type Algorithm for Quasiconvex Polynomial Integer Minimization with Complexity 2^ O (n log n)
R Hildebrand, M Köppe
Arxiv preprint arXiv:1006.4661, 2010
The integral basis method for integer programming
UU Haus, M Köppe, R Weismantel
Mathematical Methods of Operations Research 53 (3), 353-361, 2001
Rational Generating Functions and Integer Programming Games
M Köppe, CT Ryan, M Queyranne
Operations research 59 (6), 1445-1460, 2011
Ehrhart polynomials of matroid polytopes and polymatroids
JA De Loera, DC Haws, M Köppe
Discrete & computational geometry 42, 670-702, 2009
Challenging computations of Hilbert bases of cones associated with algebraic statistics
W Bruns, R Hemmecke, B Ichim, M Köppe, C Söger
Experimental Mathematics 20 (1), 25-33, 2011
Pareto optima of multicriteria integer linear programs
JA De Loera, R Hemmecke, M Köppe
INFORMS Journal on Computing 21 (1), 39-48, 2009
A -Slope Theorem for the -Dimensional Infinite Group Relaxation
A Basu, R Hildebrand, M Köppe, M Molinaro
SIAM Journal on Optimization 23 (2), 1021-1040, 2013
The system can't perform the operation now. Try again later.
Articles 1–20