Matthias Köppe

According to our database1, Matthias Köppe authored at least 54 papers between 2001 and 2019.

Collaborative distances:



In proceedings 
PhD thesis 





On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case.
Optim. Methods Softw., 2018

Equivariant perturbation in Gomory and Johnson's infinite group problem. VI. The curious case of two-sided discontinuous minimal valid functions.
Discret. Optim., 2018

Characterization and Approximation of Strong General Dual Feasible Functions.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem.
Math. Program. Comput., 2017

Equivariant perturbation in Gomory and Johnson's infinite group problem - III: foundations for the k-dimensional case with applications to k=2.
Math. Program., 2017

Guided dive for the spatial branch-and-bound.
J. Glob. Optim., 2017

Structure and Interpretation of Dual-Feasible Functions.
Electron. Notes Discret. Math., 2017

On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory-Johnson Infinite Group Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Generating Functions and Triangulations for Lecture Hall Cones.
SIAM J. Discret. Math., 2016

Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms.
4OR, 2016

Light on the infinite group relaxation I: foundations and taxonomy.
4OR, 2016

Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

Software for Cut-Generating Functions in the Gomory-Johnson Model and Beyond.
Proceedings of the Mathematical Software - ICMS 2016, 2016

An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem.
Oper. Res. Lett., 2015

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case.
Math. Oper. Res., 2015

Coefficients of Sylvester's Denumerant.
Integers, 2015

Graver basis and proximity techniques for block-structured separable convex integer minimization problems.
Math. Program., 2014

The triangle closure is a polyhedron.
Math. Program., 2014

Light on the Infinite Group Relaxation.
CoRR, 2014

A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation.
SIAM J. Optim., 2013

A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2<sup>O(<i>n</i>log<i>n</i>)</sup>.
Discret. Optim., 2013

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Algebraic and Geometric Ideas in the Theory of Discrete Optimization.
MOS-SIAM Series on Optimization 14, SIAM, ISBN: 978-1-61197-243-6, 2013

Unique Minimal Liftings for Simplicial Polytopes.
Math. Oper. Res., 2012

Computation of the Highest Coefficients of Weighted Ehrhart Quasi-polynomials of Rational Polyhedra.
Found. Comput. Math., 2012

How to integrate a polynomial over a simplex.
Math. Comput., 2011

Rational Generating Functions and Integer Programming Games.
Oper. Res., 2011

Challenging Computations of Hilbert Bases of Cones Associated with Algebraic Statistics.
Exp. Math., 2011

Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets
CoRR, 2011

Computation of atomic fibers of Z-linear maps.
Contributions Discret. Math., 2011

Software for exact integration of polynomials over polyhedra.
ACM Commun. Comput. Algebra, 2011

Intermediate Sums on Polyhedra: Computation and Real Ehrhart Theory
CoRR, 2010

A Faster Algorithm for Quasi-convex Integer Polynomial Optimization
CoRR, 2010

A Polynomial-Time Algorithm for Optimizing over <i>N</i>-Fold 4-Block Decomposable Integer Programs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Nonlinear Integer Programming.
Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

Pareto Optima of Multicriteria Integer Linear Programs.
INFORMS J. Comput., 2009

Ehrhart Polynomials of Matroid Polytopes and Polymatroids.
Discret. Comput. Geom., 2009

FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension.
Math. Program., 2008

Intermediate integer programming representations using value disjunctions.
Discret. Optim., 2008

Computing Parametric Rational Generating Functions with a Primal Barvinok Algorithm.
Electron. J. Comb., 2008

An Implementation of the Barvinok--Woods Integer Projection Algorithm.
Proceedings of the 2008 International Conference on Information Theory and Statistical Learning, 2008

A Primal Barvinok Algorithm Based on Irrational Decompositions.
SIAM J. Discret. Math., 2007

Integer Polynomial Optimization in Fixed Dimension.
Math. Oper. Res., 2006

Nondecomposable solutions to group equations and an application to polyhedral combinatorics.
4OR, 2006

FPTAS for mixed-integer polynomial optimization with a fixed number of variables.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Cutting planes from a mixed integer Farkas lemma.
Oper. Res. Lett., 2004

Extended formulations for Gomory Corner polyhedra.
Discret. Optim., 2004

On the Way to Perfection: Primal Operations for Stable Sets in Graphs.
Proceedings of the Sharpest Cut, 2004

An algorithm for mixed integer optimization.
Math. Program., 2003

Integral decomposition of polyhedra and some applications in mixed integer programming.
Math. Program., 2003

A primal all-integer algorithm based on irreducible solutions.
Math. Program., 2003

A Primal Approach to the Stable Set Problem.
Proceedings of the Algorithms, 2002

The integral basis method for integer programming.
Math. Methods Oper. Res., 2001