Matthias Köppe

Proceedings of the Mathematical Software - ICMS 2024, 2024

Fine-Grained Liquid Democracy for Cumulative Ballots.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2022

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. VII. Inverse Semigroup Theory, Closures, Decomposition of Perturbations.

[BibT_eX]

[DOI]

Open J. Math. Optim., March, 2022

Dual-feasible functions for integer programming and combinatorial optimization: Algorithms, characterizations, and approximations.

[BibT_eX]

[DOI]

Jiawei Wang

Discret. Appl. Math., 2022

2021

Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem.

[BibT_eX]

[DOI]

Math. Program., 2021

2019

On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018

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

[BibT_eX]

[DOI]

Chun Yu Hong

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.

[BibT_eX]

[DOI]

Discret. Optim., 2018

Characterization and Approximation of Strong General Dual Feasible Functions.

[BibT_eX]

[DOI]

Jiawei Wang

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017

New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Math. Program., 2017

Guided dive for the spatial branch-and-bound.

[BibT_eX]

[DOI]

Gérard Dedieu

Quentin Louveaux

J. Glob. Optim., 2017

Structure and Interpretation of Dual-Feasible Functions.

[BibT_eX]

[DOI]

Jiawei Wang

Electron. Notes Discret. Math., 2017

On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory-Johnson Infinite Group Problem.

[BibT_eX]

[DOI]

Zafeirakis Zafeirakopoulos

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016

Generating Functions and Triangulations for Lecture Hall Cones.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

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

[BibT_eX]

[DOI]

4OR, 2016

Light on the infinite group relaxation I: foundations and taxonomy.

[BibT_eX]

[DOI]

4OR, 2016

Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

Software for Cut-Generating Functions in the Gomory-Johnson Model and Beyond.

[BibT_eX]

[DOI]

Chun Yu Hong

Proceedings of the Mathematical Software - ICMS 2016, 2016

2015

An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2015

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case.

[BibT_eX]

[DOI]

Math. Oper. Res., 2015

Coefficients of Sylvester's Denumerant.

[BibT_eX]

[DOI]

Integers, 2015

2014

Graver basis and proximity techniques for block-structured separable convex integer minimization problems.

[BibT_eX]

[DOI]

Math. Program., 2014

The triangle closure is a polyhedron.

[BibT_eX]

[DOI]

Math. Program., 2014

Light on the Infinite Group Relaxation.

[BibT_eX]

[DOI]

CoRR, 2014

2013

A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation.

[BibT_eX]

[DOI]

SIAM J. Optim., 2013

A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(nlogn).

[BibT_eX]

[DOI]

Discret. Optim., 2013

Software for exact integration of polynomials over polyhedra.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Algebraic and Geometric Ideas in the Theory of Discrete Optimization.

[BibT_eX]

[DOI]

Jesús A. De Loera

MOS-SIAM Series on Optimization 14, SIAM, ISBN: 978-1-61197-243-6, 2013

2012

Unique Minimal Liftings for Simplicial Polytopes.

[BibT_eX]

[DOI]

Gérard Cornuéjols

Math. Oper. Res., 2012

Computation of the Highest Coefficients of Weighted Ehrhart Quasi-polynomials of Rational Polyhedra.

[BibT_eX]

[DOI]

Found. Comput. Math., 2012

2011

How to integrate a polynomial over a simplex.

[BibT_eX]

[DOI]

Math. Comput., 2011

Rational Generating Functions and Integer Programming Games.

[BibT_eX]

[DOI]

Christopher Thomas Ryan

Maurice Queyranne

Oper. Res., 2011

Challenging Computations of Hilbert Bases of Cones Associated with Algebraic Statistics.

[BibT_eX]

[DOI]

Exp. Math., 2011

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

[BibT_eX]

[DOI]

CoRR, 2011

Computation of atomic fibers of Z-linear maps.

[BibT_eX]

[DOI]

Elke Eisenschmidt

Contributions Discret. Math., 2011

2010

Intermediate Sums on Polyhedra: Computation and Real Ehrhart Theory

[BibT_eX]

[DOI]

CoRR, 2010

A Faster Algorithm for Quasi-convex Integer Polynomial Optimization

[BibT_eX]

[DOI]

CoRR, 2010

A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Nonlinear Integer Programming.

[BibT_eX]

[DOI]

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

2009

Pareto Optima of Multicriteria Integer Linear Programs.

[BibT_eX]

[DOI]

Jesús A. De Loera

INFORMS J. Comput., 2009

Ehrhart Polynomials of Matroid Polytopes and Polymatroids.

[BibT_eX]

[DOI]

Jesús A. De Loera

David C. Haws

Discret. Comput. Geom., 2009

2008

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

[BibT_eX]

[DOI]

Math. Program., 2008

Intermediate integer programming representations using value disjunctions.

[BibT_eX]

[DOI]

Quentin Louveaux

Discret. Optim., 2008

Computing Parametric Rational Generating Functions with a Primal Barvinok Algorithm.

[BibT_eX]

[DOI]

Sven Verdoolaege

Electron. J. Comb., 2008

An Implementation of the Barvinok--Woods Integer Projection Algorithm.

[BibT_eX]

Sven Verdoolaege

Kevin M. Woods

Proceedings of the 2008 International Conference on Information Theory and Statistical Learning, 2008

2007

A Primal Barvinok Algorithm Based on Irrational Decompositions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

Integrally indecomposable polytopes and the survivable network design problem.

[BibT_eX]

[DOI]

Elke Eisenschmidt

Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, 2007

2006

Integer Polynomial Optimization in Fixed Dimension.

[BibT_eX]

[DOI]

Math. Oper. Res., 2006

Nondecomposable solutions to group equations and an application to polyhedral combinatorics.

[BibT_eX]

[DOI]

Matthias Jach

4OR, 2006

FPTAS for mixed-integer polynomial optimization with a fixed number of variables.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2004

Cutting planes from a mixed integer Farkas lemma.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

Extended formulations for Gomory Corner polyhedra.

[BibT_eX]

[DOI]

Discret. Optim., 2004

On the Way to Perfection: Primal Operations for Stable Sets in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Sharpest Cut, 2004

2003

An algorithm for mixed integer optimization.

[BibT_eX]

[DOI]

Math. Program., 2003

Integral decomposition of polyhedra and some applications in mixed integer programming.

[BibT_eX]

[DOI]

Martin Henk

Math. Program., 2003

A primal all-integer algorithm based on irreducible solutions.

[BibT_eX]

[DOI]

Utz-Uwe Haus

Math. Program., 2003

2002

A Primal Approach to the Stable Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

2001

The integral basis method for integer programming.

[BibT_eX]

[DOI]

Utz-Uwe Haus