default search action
Matthias Köppe
Person information
- affiliation: University of California, Davis, Department of Mathematics
- affiliation: Otto von Guericke University of Magdeburg, Department of Mathematics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Matthias Köppe, Martin Koutecký, Krzysztof Sornat, Nimrod Talmon:
Fine-Grained Liquid Democracy for Cumulative Ballots. AAMAS 2024: 1029-1037 - [c12]Matthias Köppe:
The Reformation of Sage. ICMS 2024: 3-11 - 2022
- [j42]Matthias Köppe, Jiawei Wang:
Dual-feasible functions for integer programming and combinatorial optimization: Algorithms, characterizations, and approximations. Discret. Appl. Math. 308: 84-106 (2022) - [j41]Robert Hildebrand, Matthias Köppe, Yuan Zhou:
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. VII. Inverse Semigroup Theory, Closures, Decomposition of Perturbations. Open J. Math. Optim. 3: 1-44 (2022) - [i12]Matthias Köppe, Martin Koutecký, Krzysztof Sornat, Nimrod Talmon:
Fine-Grained Liquid Democracy for Cumulative Ballots. CoRR abs/2208.14441 (2022) - 2021
- [j40]Matthias Köppe, Yuan Zhou:
Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem. Math. Program. 187(1): 195-252 (2021)
2010 – 2019
- 2019
- [c11]Robert Hildebrand, Matthias Köppe, Yuan Zhou:
On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem. IPCO 2019: 247-260 - 2018
- [j39]Matthias Köppe, Yuan Zhou:
Equivariant perturbation in Gomory and Johnson's infinite group problem. VI. The curious case of two-sided discontinuous minimal valid functions. Discret. Optim. 30: 51-72 (2018) - [j38]Chun Yu Hong, Matthias Köppe, Yuan Zhou:
Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case. Optim. Methods Softw. 33(3): 475-498 (2018) - [c10]Matthias Köppe, Jiawei Wang:
Characterization and Approximation of Strong General Dual Feasible Functions. ISCO 2018: 265-276 - 2017
- [j37]Matthias Köppe, Jiawei Wang:
Structure and Interpretation of Dual-Feasible Functions. Electron. Notes Discret. Math. 62: 153-158 (2017) - [j36]Gérard Dedieu, Matthias Köppe, Quentin Louveaux:
Guided dive for the spatial branch-and-bound. J. Glob. Optim. 68(4): 685-711 (2017) - [j35]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Equivariant perturbation in Gomory and Johnson's infinite group problem - III: foundations for the k-dimensional case with applications to k=2. Math. Program. 163(1-2): 301-358 (2017) - [j34]Matthias Köppe, Yuan Zhou:
New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem. Math. Program. Comput. 9(3): 419-469 (2017) - [c9]Matthias Köppe, Yuan Zhou:
On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory-Johnson Infinite Group Problem. IPCO 2017: 330-342 - 2016
- [j33]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Light on the infinite group relaxation I: foundations and taxonomy. 4OR 14(1): 1-40 (2016) - [j32]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms. 4OR 14(2): 107-131 (2016) - [j31]Matthias Beck, Benjamin Braun, Matthias Köppe, Carla D. Savage, Zafeirakis Zafeirakopoulos:
Generating Functions and Triangulations for Lecture Hall Cones. SIAM J. Discret. Math. 30(3): 1470-1479 (2016) - [c8]Chun Yu Hong, Matthias Köppe, Yuan Zhou:
Software for Cut-Generating Functions in the Gomory-Johnson Model and Beyond. ICMS 2016: 284-291 - [c7]Matthias Köppe, Yuan Zhou:
Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems. ISCO 2016: 332-344 - 2015
- [j30]Velleda Baldoni, Nicole Berline, Jesús A. De Loera, Brandon E. Dutra, Matthias Köppe, Michèle Vergne:
Coefficients of Sylvester's Denumerant. Integers 15: A11 (2015) - [j29]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case. Math. Oper. Res. 40(1): 105-129 (2015) - [j28]Matthias Köppe, Yuan Zhou:
An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem. Oper. Res. Lett. 43(4): 438-444 (2015) - 2014
- [j27]Raymond Hemmecke, Matthias Köppe, Robert Weismantel:
Graver basis and proximity techniques for block-structured separable convex integer minimization problems. Math. Program. 145(1-2): 1-18 (2014) - [j26]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
The triangle closure is a polyhedron. Math. Program. 145(1-2): 19-58 (2014) - [i11]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. III. Foundations for the k-Dimensional Case with Applications to k=2. CoRR abs/1403.4628 (2014) - [i10]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Light on the Infinite Group Relaxation. CoRR abs/1410.8584 (2014) - [i9]Matthias Köppe, Yuan Zhou:
An Electronic Compendium of Extreme Functions for the Gomory-Johnson Infinite Group Problem. CoRR abs/1411.5121 (2014) - 2013
- [b1]Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe:
Algebraic and Geometric Ideas in the Theory of Discrete Optimization. MOS-SIAM Series on Optimization 14, SIAM 2013, ISBN 978-1-61197-243-6, pp. I-XIX, 1-322 - [j25]Jesús A. De Loera, Brandon E. Dutra, Matthias Köppe, S. Moreinis, G. Pinto, J. Wu:
Software for exact integration of polynomials over polyhedra. Comput. Geom. 46(3): 232-252 (2013) - [j24]Robert Hildebrand, Matthias Köppe:
A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(nlogn). Discret. Optim. 10(1): 69-84 (2013) - [j23]Amitabh Basu, Robert Hildebrand, Matthias Köppe, Marco Molinaro:
A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation. SIAM J. Optim. 23(2): 1021-1040 (2013) - [c6]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case. IPCO 2013: 62-73 - 2012
- [j22]Velleda Baldoni, Nicole Berline, Jesús A. De Loera, Matthias Köppe, Michèle Vergne:
Computation of the Highest Coefficients of Weighted Ehrhart Quasi-polynomials of Rational Polyhedra. Found. Comput. Math. 12(4): 435-469 (2012) - [j21]Amitabh Basu, Gérard Cornuéjols, Matthias Köppe:
Unique Minimal Liftings for Simplicial Polytopes. Math. Oper. Res. 37(2): 346-355 (2012) - [i8]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. II. The Unimodular Two-Dimensional Case. CoRR abs/1210.6732 (2012) - 2011
- [j20]Jesús A. De Loera, Brandon E. Dutra, Matthias Köppe, S. Moreinis, G. Pinto, J. Wu:
Software for exact integration of polynomials over polyhedra. ACM Commun. Comput. Algebra 45(3/4): 169-172 (2011) - [j19]Elke Eisenschmidt, Raymond Hemmecke, Matthias Köppe:
Computation of atomic fibers of Z-linear maps. Contributions Discret. Math. 6(2) (2011) - [j18]Winfried Bruns, Raymond Hemmecke, Bogdan Ichim, Matthias Köppe, Christof Söger:
Challenging Computations of Hilbert Bases of Cones Associated with Algebraic Statistics. Exp. Math. 20(1): 25-33 (2011) - [j17]Matthias Köppe, Christopher Thomas Ryan, Maurice Queyranne:
Rational Generating Functions and Integer Programming Games. Oper. Res. 59(6): 1445-1460 (2011) - [j16]Velleda Baldoni, Nicole Berline, Jesús A. De Loera, Matthias Köppe, Michèle Vergne:
How to integrate a polynomial over a simplex. Math. Comput. 80(273): 297-325 (2011) - [i7]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets. CoRR abs/1107.5068 (2011) - [i6]Amitabh Basu, Robert Hildebrand, Matthias Köppe:
The Triangle Closure is a Polyhedron. CoRR abs/1111.1780 (2011) - 2010
- [c5]Raymond Hemmecke, Matthias Köppe, Robert Weismantel:
A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs. IPCO 2010: 219-229 - [p2]Raymond Hemmecke, Matthias Köppe, Jon Lee, Robert Weismantel:
Nonlinear Integer Programming. 50 Years of Integer Programming 2010: 561-618 - [i5]Robert Hildebrand, Matthias Köppe:
A Faster Algorithm for Quasi-convex Integer Polynomial Optimization. CoRR abs/1006.4661 (2010) - [i4]Velleda Baldoni, Nicole Berline, Jesús A. De Loera, Matthias Köppe, Michèle Vergne:
Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra. CoRR abs/1011.1602 (2010) - [i3]Velleda Baldoni, Nicole Berline, Matthias Köppe, Michèle Vergne:
Intermediate Sums on Polyhedra: Computation and Real Ehrhart Theory. CoRR abs/1011.6002 (2010)
2000 – 2009
- 2009
- [j15]Jesús A. De Loera, David C. Haws, Matthias Köppe:
Ehrhart Polynomials of Matroid Polytopes and Polymatroids. Discret. Comput. Geom. 42(4): 670-702 (2009) - [j14]Jesús A. De Loera, David C. Haws, Matthias Köppe:
Ehrhart Polynomials of Matroid Polytopes and Polymatroids. Discret. Comput. Geom. 42(4): 703-704 (2009) - [j13]Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe:
Pareto Optima of Multicriteria Integer Linear Programs. INFORMS J. Comput. 21(1): 39-48 (2009) - 2008
- [j12]Matthias Köppe, Sven Verdoolaege:
Computing Parametric Rational Generating Functions with a Primal Barvinok Algorithm. Electron. J. Comb. 15(1) (2008) - [j11]Matthias Köppe, Quentin Louveaux, Robert Weismantel:
Intermediate integer programming representations using value disjunctions. Discret. Optim. 5(2): 293-313 (2008) - [j10]Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe, Robert Weismantel:
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension. Math. Program. 115(2): 273-290 (2008) - [c4]Matthias Köppe, Sven Verdoolaege, Kevin M. Woods:
An Implementation of the Barvinok--Woods Integer Projection Algorithm. ITSL 2008: 53-59 - [i2]Matthias Köppe, Christopher Thomas Ryan, Maurice Queyranne:
Rational Generating Functions and Integer Programming Games. CoRR abs/0809.0689 (2008) - [i1]Velleda Baldoni, Nicole Berline, Jesús A. De Loera, Matthias Köppe, Michèle Vergne:
How to Integrate a Polynomial over a Simplex. CoRR abs/0809.2083 (2008) - 2007
- [j9]Matthias Köppe:
A Primal Barvinok Algorithm Based on Irrational Decompositions. SIAM J. Discret. Math. 21(1): 220-236 (2007) - [c3]Elke Eisenschmidt, Matthias Köppe:
Integrally indecomposable polytopes and the survivable network design problem. DRCN 2007: 1-8 - 2006
- [j8]Matthias Jach, Matthias Köppe, Robert Weismantel:
Nondecomposable solutions to group equations and an application to polyhedral combinatorics. 4OR 4(1): 29-46 (2006) - [j7]Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe, Robert Weismantel:
Integer Polynomial Optimization in Fixed Dimension. Math. Oper. Res. 31(1): 147-153 (2006) - [c2]Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe, Robert Weismantel:
FPTAS for mixed-integer polynomial optimization with a fixed number of variables. SODA 2006: 743-748 - 2004
- [j6]Matthias Köppe, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey:
Extended formulations for Gomory Corner polyhedra. Discret. Optim. 1(2): 141-165 (2004) - [j5]Matthias Köppe, Robert Weismantel:
Cutting planes from a mixed integer Farkas lemma. Oper. Res. Lett. 32(3): 207-211 (2004) - [p1]Claudio Gentile, Utz-Uwe Haus, Matthias Köppe, Giovanni Rinaldi, Robert Weismantel:
On the Way to Perfection: Primal Operations for Stable Sets in Graphs. The Sharpest Cut 2004: 51-76 - 2003
- [j4]Martin Henk, Matthias Köppe, Robert Weismantel:
Integral decomposition of polyhedra and some applications in mixed integer programming. Math. Program. 94(2-3): 193-206 (2003) - [j3]Utz-Uwe Haus, Matthias Köppe, Robert Weismantel:
A primal all-integer algorithm based on irreducible solutions. Math. Program. 96(2): 205-246 (2003) - [j2]Matthias Köppe, Robert Weismantel:
An algorithm for mixed integer optimization. Math. Program. 98(1-3): 281-307 (2003) - 2002
- [c1]Claudio Gentile, Utz-Uwe Haus, Matthias Köppe, Giovanni Rinaldi, Robert Weismantel:
A Primal Approach to the Stable Set Problem. ESA 2002: 525-537 - 2001
- [j1]Utz-Uwe Haus, Matthias Köppe, Robert Weismantel:
The integral basis method for integer programming. Math. Methods Oper. Res. 53(3): 353-361 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint