Matthias KöPpe - Citegraph

Author Info

Name	Affiliation	Papers
MATTHIAS KÖPPE	Department of Mathematics/IMO, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, 39106 Magdeburg, Germany	40
Collaborators	Citations	PageRank
32	191	20.95
Referers	Referees	References
218	327	440

Search Limit

100327

Publications (40 rows)

Collaborators (32 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Dual-feasible functions for integer programming and combinatorial optimization: Algorithms, characterizations, and approximations	0	0.34	2022
Facets, Weak Facets, And Extreme Functions Of The Gomory-Johnson Infinite Group Problem	0	0.34	2021
On Perturbation Spaces Of Minimal Valid Functions: Inverse Semigroup Theory And Equivariant Decomposition Theorem	0	0.34	2019
Equivariant perturbation in Gomory and Johnson's infinite group problem. VI. The curious case of two-sided discontinuous minimal valid functions.	0	0.34	2018
Guided dive for the spatial branch-and-bound.	0	0.34	2017
New computer-based search strategies for extreme functions of the Gomory--Johnson infinite group problem	5	0.46	2017
On The Notions Of Facets, Weak Facets, And Extreme Functions Of The Gomory-Johnson Infinite Group Problem	1	0.36	2017
Structure and Interpretation of Dual-Feasible Functions.	0	0.34	2017
Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms	11	0.62	2016
Light on the infinite group relaxation I: foundations and taxonomy.	1	0.35	2016
Software for Cut-Generating Functions in the Gomory-Johnson Model and Beyond.	2	0.41	2016
Generating functions and triangulations for lecture hall cones	2	0.43	2016
Coefficients of Sylvester's Denumerant.	0	0.34	2015
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case	5	0.41	2015
Graver basis and proximity techniques for block-structured separable convex integer minimization problems	5	0.53	2014
The triangle closure is a polyhedron	5	0.44	2014
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. III. Foundations for the k-Dimensional Case with Applications to k=2.	8	0.51	2014
Light On The Infinite Group Relaxation I: Foundations And Taxonomy	15	0.79	2014
A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation.	14	0.75	2013
Equivariant perturbation in gomory and Johnson's infinite group problem: II. the unimodular two-dimensional case	4	0.39	2013
A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(nlogn).	0	0.34	2013
Unique Minimal Liftings for Simplicial Polytopes	11	0.62	2012
Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets	4	0.40	2011
Computation of atomic fibers of Z-linear maps.	0	0.34	2011
How to Integrate a Polynomial over a Simplex	25	2.06	2011
A Faster Algorithm for Quasi-convex Integer Polynomial Optimization	2	0.37	2010
Intermediate Sums on Polyhedra: Computation and Real Ehrhart Theory	4	0.57	2010
A polynomial-time algorithm for optimizing over N-flod 4-block decomposable integer programs	4	0.48	2010
Ehrhart Polynomials of Matroid Polytopes and Polymatroids	4	0.77	2009
Pareto Optima of Multicriteria Integer Linear Programs	11	0.61	2009
Rational Generating Functions and Integer Programming Games	6	0.51	2008
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension	6	0.59	2008
Intermediate integer programming representations using value disjunctions	5	0.55	2008
Nondecomposable solutions to group equations and an application to polyhedral combinatorics	0	0.34	2006
Cutting planes from a mixed integer Farkas lemma	4	0.64	2004
Extended formulations for Gomory Corner polyhedra	4	0.51	2004
An algorithm for mixed integer optimization	2	0.42	2003
A primal all-integer algorithm based on irreducible solutions.	14	0.98	2003
Integral decomposition of polyhedra and some applications in mixed integer programming	6	0.66	2003
A Primal Approach to the Stable Set Problem	1	0.37	2002