| Publication | Date of Publication | Type |
|---|
| A colorful Steinitz lemma with application to block-structured integer programs | 2024-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147356 | 2024-01-15 | Paper |
| Sparse approximation over the cube | 2023-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075921 | 2023-09-20 | Paper |
| Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube | 2023-06-07 | Paper |
| 0/1-Integer programming: Optimization and Augmentation are equivalent | 2023-05-08 | Paper |
| The Integrality Number of an Integer Program | 2022-10-14 | Paper |
| On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases | 2022-08-31 | Paper |
| Improving the Cook et al. proximity bound given integral valued constraints | 2022-08-16 | Paper |
| Notes on \(\{a,b,c\}\)-modular matrices | 2022-05-04 | Paper |
| The integrality number of an integer program | 2022-03-22 | Paper |
| On the recognition of \(\{a,b,c\}\)-modular matrices | 2021-12-21 | Paper |
| Decomposition of integer programs and of generating sets | 2021-12-20 | Paper |
| Test sets of the knapsack problem and simultaneous Diophantine approximation | 2021-12-20 | Paper |
| The Distributions of Functions Related to Parametric Integer Optimization | 2020-10-07 | Paper |
| Subset Selection in Sparse Matrices | 2020-04-24 | Paper |
| Sparsity of integer solutions in the average case | 2020-02-06 | Paper |
| Distances between optimal solutions of mixed-integer programs | 2020-01-17 | Paper |
| Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma | 2019-12-02 | Paper |
| Integer quadratic programming in the plane | 2019-06-20 | Paper |
| Optimality certificates for convex minimization and Helly numbers | 2019-02-22 | Paper |
| Test sets and inequalities for integer programs | 2019-01-11 | Paper |
| Quadratic knapsack relaxations using cutting planes and semidefinite programming | 2019-01-11 | Paper |
| A note on non-degenerate integer programs with small sub-determinants | 2019-01-11 | Paper |
| Integer convex minimization by mixed integer linear optimization | 2018-09-28 | Paper |
| Note on the complexity of the mixed-integer hull of a polyhedron | 2018-09-28 | Paper |
| The Support of Integer Optimal Solutions | 2018-08-03 | Paper |
| On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants | 2018-07-18 | Paper |
| Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations | 2018-07-16 | Paper |
| An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra | 2018-07-16 | Paper |
| Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix | 2018-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607934 | 2018-03-15 | Paper |
| A strongly polynomial algorithm for bimodular integer linear programming | 2017-08-17 | Paper |
| Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations | 2017-06-20 | Paper |
| Duality for mixed-integer convex minimization | 2016-08-25 | Paper |
| Relaxations of mixed integer sets from lattice-free polyhedra | 2016-07-22 | Paper |
| Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane | 2016-05-19 | Paper |
| A Polyhedral Frobenius Theorem with Applications to Integer Optimization | 2015-07-31 | Paper |
| Mirror-Descent Methods in Mixed-Integer Convex Optimization | 2015-07-22 | Paper |
| Time-Expanded Packings | 2014-07-01 | Paper |
| Graver basis and proximity techniques for block-structured separable convex integer minimization problems | 2014-06-27 | Paper |
| The quadratic Graver cone, quadratic integer minimization, and extensions | 2012-12-19 | Paper |
| Relaxations of mixed integer sets from lattice-free polyhedra | 2012-12-07 | Paper |
| Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes | 2012-11-02 | Paper |
| On convergence in mixed integer programming | 2012-10-15 | Paper |
| Cone superadditivity of discrete convex functions | 2012-10-15 | Paper |
| A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts | 2012-07-13 | Paper |
| Transversal numbers over subsets of linear spaces | 2012-06-13 | Paper |
| Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three | 2012-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3096727 | 2011-11-11 | Paper |
| Graph problems arising from parameter identification of discrete dynamical systems | 2011-08-16 | Paper |
| Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks | 2011-07-28 | Paper |
| The combinatorics of modeling and analyzing biological systems | 2011-07-28 | Paper |
| An algorithmic framework for network reconstruction | 2011-06-28 | Paper |
| Intractability of approximate multi-dimensional nonlinear optimization on independence systems | 2011-05-06 | Paper |
| An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets | 2011-04-27 | Paper |
| Integer Programming Subject to Monomial Constraints | 2011-03-21 | Paper |
| \(N\)-fold integer programming and nonlinear multi-transshipment | 2011-03-14 | Paper |
| A polynomial oracle-time algorithm for convex integer minimization | 2011-02-14 | Paper |
| Approximate Nonlinear Optimization over Weighted Independence Systems | 2010-12-03 | Paper |
| Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three | 2010-10-06 | Paper |
| Parametric nonlinear discrete optimization over well-described sets and matroid intersections | 2010-09-16 | Paper |
| Mixed-integer sets from two rows of two adjacent simplex bases | 2010-09-16 | Paper |
| FPTAS for mixed-integer polynomial optimization with a fixed number of variables | 2010-08-16 | Paper |
| Zero-Coefficient Cuts | 2010-06-22 | Paper |
| A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs | 2010-06-22 | Paper |
| Nonlinear Integer Programming | 2010-06-03 | Paper |
| On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows | 2010-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3181641 | 2009-10-12 | Paper |
| Throughput-optimal sequences for cyclically operated plants | 2009-10-09 | Paper |
| Nonlinear Matroid Optimization and Experimental Design | 2009-08-20 | Paper |
| The Convex Envelope of (n–1)-Convex Functions | 2009-08-20 | Paper |
| Nonlinear Optimization over a Weighted Independence System | 2009-07-02 | Paper |
| Convex integer maximization via Graver bases | 2009-05-12 | Paper |
| On test sets for nonlinear integer maximization | 2009-03-04 | Paper |
| Certificates of linear mixed integer infeasibility | 2009-01-09 | Paper |
| \(N\)-fold integer programming | 2008-10-29 | Paper |
| Intermediate integer programming representations using value disjunctions | 2008-10-29 | Paper |
| FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension | 2008-10-16 | Paper |
| Integer Polynomial Optimization in Fixed Dimension | 2008-05-27 | Paper |
| A mathematical approach to solve the network reconstruction problem | 2008-04-23 | Paper |
| Polyhedral properties for the intersection of two knapsacks | 2008-03-12 | Paper |
| Representation of Sets of Lattice Points | 2008-02-25 | Paper |
| Inequalities from Two Rows of a Simplex Tableau | 2007-11-29 | Paper |
| Mod‐2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets | 2007-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5292087 | 2007-06-19 | Paper |
| Nondecomposable solutions to group equations and an application to polyhedral combinatorics | 2007-01-24 | Paper |
| Polyhedra related to integer-convex polynomial systems | 2006-01-13 | Paper |
| The Complexity of Generic Primal Algorithms for Solving General Integer Programs | 2005-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465110 | 2005-08-22 | Paper |
| Extended formulations for Gomory corner polyhedra | 2005-08-22 | Paper |
| Optimality criterion for a class of nonlinear integer programs. | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737513 | 2004-08-11 | Paper |
| Cutting planes from a mixed integer Farkas lemma. | 2004-03-15 | Paper |
| A primal all-integer algorithm based on irreducible solutions | 2004-03-11 | Paper |
| An algorithm for mixed integer optimization | 2004-03-11 | Paper |
| Integral decomposition of polyhedra and some applications in mixed integer programming | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414637 | 2003-07-25 | Paper |
| The integral basis method for integer programming | 2003-07-15 | Paper |
| Exponential irreducible neighborhoods for combinatorial optimization problems | 2003-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411388 | 2003-07-08 | Paper |
| Diophantine approximations and integer points of cones | 2003-05-18 | Paper |
| Non-standard approaches to integer programming | 2002-09-17 | Paper |
| Cutting planes in integer and mixed integer programming | 2002-09-17 | Paper |
| The height of minimal Hilbert bases | 2001-07-22 | Paper |
| Discrete relaxations of combinatorial programs | 2001-01-01 | Paper |
| Set packing relaxations of some integer programs | 2000-12-03 | Paper |
| A semidefinite programming approach to the quadratic knapsack problem | 2000-10-30 | Paper |
| On minimal solutions of Diophantine equations | 2000-04-26 | Paper |
| Test sets of integer programs | 1999-08-22 | Paper |
| The node capacitated graph partitioning problem: A computational study | 1999-06-03 | Paper |
| Truncated Gröbner bases for integer programming | 1999-06-01 | Paper |
| A counterexample to an integer analogue of Carathéodory's theorem | 1999-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234161 | 1999-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252434 | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840363 | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400647 | 1998-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398360 | 1998-07-19 | Paper |
| The Steiner tree packing problem in VLSI design | 1998-06-22 | Paper |
| The Sequential Knapsack Polytope | 1998-05-12 | Paper |
| A Variant of the Buchberger Algorithm for Integer Programming | 1997-05-20 | Paper |
| Hilbert Bases and the Facets of Special Knapsack Polytopes | 1997-02-13 | Paper |
| Solving Multiple Knapsack Problems by Cutting Planes | 1997-02-03 | Paper |
| Packing Steiner trees: A cutting plane algorithm and computational results | 1997-01-06 | Paper |
| Optimum path packing on wheels: The consecutive case | 1997-01-06 | Paper |
| On the \(0/1\) knapsack polytope | 1997-01-01 | Paper |
| Formulations and valid inequalities of the node capacitated graph partitioning problem | 1996-10-31 | Paper |
| Packing Steiner Trees: Separation Algorithms | 1996-10-03 | Paper |
| Packing Steiner trees: Further facets | 1996-07-14 | Paper |
| Routing in grid graphs by cutting planes | 1996-05-30 | Paper |
| Gröbner bases of lattices, corner polyhedra, and integer programming | 1996-01-01 | Paper |
| Packing Steiner trees: Polyhedral investigations | 1996-01-01 | Paper |
| Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits | 1994-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4280133 | 1994-05-24 | Paper |
| Some integer programs arising in the design of main frame computers | 1993-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4023740 | 1993-01-23 | Paper |
