| Publication | Date of Publication | Type |
|---|
| Sparse approximation in lattices and semigroups | 2025-12-22 | Paper |
| On matrices over a polynomial ring with restricted subdeterminants | 2025-02-07 | Paper |
Proximity and flatness bounds for linear integer optimization
Mathematics of Operations Research | 2025-01-28 | Paper |
A colorful Steinitz lemma with application to block-structured integer programs
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
scientific article; zbMATH DE number 7788439 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| Forall-exist statements in pseudopolynomial time | 2023-11-13 | Paper |
Sparse approximation over the cube
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity
(available as arXiv preprint) | 2023-09-20 | Paper |
Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube
SIAM Journal on Optimization | 2023-06-07 | Paper |
0/1-Integer programming: Optimization and Augmentation are equivalent
Lecture Notes in Computer Science | 2023-05-08 | Paper |
| Alternating Linear Minimization: Revisiting von Neumann's alternating projections | 2022-12-06 | Paper |
| Proximity and flatness bounds for linear integer optimization | 2022-11-27 | Paper |
The Integrality Number of an Integer Program
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
On lattice width of lattice-free polyhedra and height of Hilbert bases
SIAM Journal on Discrete Mathematics | 2022-08-31 | Paper |
Improving the Cook et al. proximity bound given integral valued constraints
(available as arXiv preprint) | 2022-08-16 | Paper |
Notes on \(\{a,b,c\}\)-modular matrices
Vietnam Journal of Mathematics | 2022-05-04 | Paper |
The integrality number of an integer program
Mathematical Programming. Series A. Series B | 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
SIAM Journal on Applied Algebra and Geometry | 2020-10-07 | Paper |
Subset selection in sparse matrices
SIAM Journal on Optimization | 2020-04-24 | Paper |
| Sparsity of integer solutions in the average case | 2020-02-06 | Paper |
Sparsity of integer solutions in the average case
(available as arXiv preprint) | 2020-02-06 | Paper |
Distances between optimal solutions of mixed-integer programs
Mathematical Programming. Series A. Series B | 2020-01-17 | Paper |
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Integer quadratic programming in the plane
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Optimality certificates for convex minimization and Helly numbers
Operations Research Letters | 2019-02-22 | Paper |
Quadratic knapsack relaxations using cutting planes and semidefinite programming
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
Test sets and inequalities for integer programs
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
A note on non-degenerate integer programs with small sub-determinants
Operations Research Letters | 2019-01-11 | Paper |
Note on the complexity of the mixed-integer hull of a polyhedron
Operations Research Letters | 2018-09-28 | Paper |
Note on the complexity of the mixed-integer hull of a polyhedron
Operations Research Letters | 2018-09-28 | Paper |
Integer convex minimization by mixed integer linear optimization
Operations Research Letters | 2018-09-28 | Paper |
The support of integer optimal solutions
SIAM Journal on Optimization | 2018-08-03 | Paper |
On the number of distinct rows of a matrix with bounded subdeterminants
SIAM Journal on Discrete Mathematics | 2018-07-18 | Paper |
Extension complexity lower bounds for mixed-integer extended formulations
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
An FPTAS for minimizing indefinite quadratic forms over integers in polyhedra
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
Mathematical Programming. Series A. Series B | 2018-06-25 | Paper |
| scientific article; zbMATH DE number 6850361 (Why is no real title available?) | 2018-03-15 | Paper |
A strongly polynomial algorithm for bimodular integer linear programming
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
Optimization and Engineering | 2017-06-20 | Paper |
Duality for mixed-integer convex minimization
Mathematical Programming. Series A. Series B | 2016-08-25 | Paper |
Duality for mixed-integer convex minimization
Mathematical Programming. Series A. Series B | 2016-08-25 | Paper |
Relaxations of mixed integer sets from lattice-free polyhedra
Annals of Operations Research | 2016-07-22 | Paper |
Minimizing cubic and homogeneous polynomials over integers in the plane
Mathematics of Operations Research | 2016-05-19 | Paper |
A Polyhedral Frobenius Theorem with Applications to Integer Optimization
SIAM Journal on Discrete Mathematics | 2015-07-31 | Paper |
Mirror-Descent Methods in Mixed-Integer Convex Optimization
Facets of Combinatorial Optimization | 2015-07-22 | Paper |
Mirror-Descent Methods in Mixed-Integer Convex Optimization
Facets of Combinatorial Optimization | 2015-07-22 | Paper |
Time-expanded packings
Automata, Languages, and Programming | 2014-07-01 | Paper |
Graver basis and proximity techniques for block-structured separable convex integer minimization problems
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
The quadratic Graver cone, quadratic integer minimization, and extensions
Mathematical Programming. Series A. Series B | 2012-12-19 | Paper |
Relaxations of mixed integer sets from lattice-free polyhedra
4OR | 2012-12-07 | Paper |
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes
Mathematical Programming. Series A. Series B | 2012-11-02 | Paper |
On convergence in mixed integer programming
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
Cone superadditivity of discrete convex functions
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
Operations Research Letters | 2012-07-13 | Paper |
Transversal numbers over subsets of linear spaces
Advances in Geometry | 2012-06-13 | Paper |
Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
Mathematics of Operations Research | 2012-05-24 | Paper |
| Convex integer minimization in fixed dimension | 2012-03-19 | Paper |
| A cutting plane theory for mixed integer optimization | 2011-11-11 | Paper |
Graph problems arising from parameter identification of discrete dynamical systems
Mathematical Methods of Operations Research | 2011-08-16 | Paper |
The combinatorics of modeling and analyzing biological systems
Natural Computing | 2011-07-28 | Paper |
Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks
Natural Computing | 2011-07-28 | Paper |
An algorithmic framework for network reconstruction
Theoretical Computer Science | 2011-06-28 | Paper |
Intractability of approximate multi-dimensional nonlinear optimization on independence systems
Discrete Mathematics | 2011-05-06 | Paper |
An analysis of mixed integer linear sets based on lattice point free convex sets
Mathematics of Operations Research | 2011-04-27 | Paper |
Integer Programming Subject to Monomial Constraints
SIAM Journal on Optimization | 2011-03-21 | Paper |
\(N\)-fold integer programming and nonlinear multi-transshipment
Optimization Letters | 2011-03-14 | Paper |
A polynomial oracle-time algorithm for convex integer minimization
Mathematical Programming. Series A. Series B | 2011-02-14 | Paper |
Approximate nonlinear optimization over weighted independence systems
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
Mathematics of Operations Research | 2010-10-06 | Paper |
Mixed-integer sets from two rows of two adjacent simplex bases
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Parametric nonlinear discrete optimization over well-described sets and matroid intersections
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
FPTAS for mixed-integer polynomial optimization with a fixed number of variables
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Zero-coefficient cuts
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Nonlinear integer programming
50 Years of Integer Programming 1958-2008 | 2010-06-03 | Paper |
On an analysis of the strength of mixed-integer cutting planes from multiple simplex tableau rows
SIAM Journal on Optimization | 2010-06-01 | Paper |
| scientific article; zbMATH DE number 5613969 (Why is no real title available?) | 2009-10-12 | Paper |
Throughput-optimal sequences for cyclically operated plants
Discrete Event Dynamic Systems | 2009-10-09 | Paper |
The Convex Envelope of (<i>n</i>–1)-Convex Functions
SIAM Journal on Optimization | 2009-08-20 | Paper |
Nonlinear Matroid Optimization and Experimental Design
SIAM Journal on Discrete Mathematics | 2009-08-20 | Paper |
Nonlinear Optimization over a Weighted Independence System
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
Convex integer maximization via Graver bases
Journal of Pure and Applied Algebra | 2009-05-12 | Paper |
| Maximal integral simplices with no interior integer points | 2009-04-14 | Paper |
On test sets for nonlinear integer maximization
Operations Research Letters | 2009-03-04 | Paper |
Certificates of linear mixed integer infeasibility
Operations Research Letters | 2009-01-09 | Paper |
\(N\)-fold integer programming
Discrete Optimization | 2008-10-29 | Paper |
Intermediate integer programming representations using value disjunctions
Discrete Optimization | 2008-10-29 | Paper |
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
Mathematical Programming. Series A. Series B | 2008-10-16 | Paper |
| Nonlinear optimization for matroid intersection and extensions | 2008-07-24 | Paper |
Integer Polynomial Optimization in Fixed Dimension
Mathematics of Operations Research | 2008-05-27 | Paper |
A mathematical approach to solve the network reconstruction problem
Mathematical Methods of Operations Research | 2008-04-23 | Paper |
Polyhedral properties for the intersection of two knapsacks
Mathematical Programming. Series A. Series B | 2008-03-12 | Paper |
Representation of Sets of Lattice Points
SIAM Journal on Optimization | 2008-02-25 | Paper |
Inequalities from Two Rows of a Simplex Tableau
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Mod‐2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets
SIAM Journal on Discrete Mathematics | 2007-11-16 | Paper |
| Primal integer programming | 2007-06-19 | Paper |
Nondecomposable solutions to group equations and an application to polyhedral combinatorics
4OR | 2007-01-24 | Paper |
Polyhedra related to integer-convex polynomial systems
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
Mathematics of Operations Research | 2005-11-11 | Paper |
| scientific article; zbMATH DE number 2196278 (Why is no real title available?) | 2005-08-22 | Paper |
Extended formulations for Gomory corner polyhedra
Discrete Optimization | 2005-08-22 | Paper |
Optimality criterion for a class of nonlinear integer programs.
Operations Research Letters | 2005-01-11 | Paper |
| Integral Function Bases | 2004-10-08 | Paper |
| scientific article; zbMATH DE number 2086910 (Why is no real title available?) | 2004-08-11 | Paper |
Cutting planes from a mixed integer Farkas lemma.
Operations Research Letters | 2004-03-15 | Paper |
A primal all-integer algorithm based on irreducible solutions
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
An algorithm for mixed integer optimization
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
Integral decomposition of polyhedra and some applications in mixed integer programming
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
| scientific article; zbMATH DE number 1953191 (Why is no real title available?) | 2003-07-25 | Paper |
The integral basis method for integer programming
Mathematical Methods of Operations Research | 2003-07-15 | Paper |
Exponential irreducible neighborhoods for combinatorial optimization problems
Mathematical Methods of Operations Research | 2003-07-14 | Paper |
| scientific article; zbMATH DE number 1947419 (Why is no real title available?) | 2003-07-08 | Paper |
Diophantine approximations and integer points of cones
Combinatorica | 2003-05-18 | Paper |
Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics | 2002-09-17 | Paper |
Non-standard approaches to integer programming
Discrete Applied Mathematics | 2002-09-17 | Paper |
The height of minimal Hilbert bases
Results in Mathematics | 2001-07-22 | Paper |
Discrete relaxations of combinatorial programs
Discrete Applied Mathematics | 2001-01-01 | Paper |
Set packing relaxations of some integer programs
Mathematical Programming. Series A. Series B | 2000-12-03 | Paper |
A semidefinite programming approach to the quadratic knapsack problem
Journal of Combinatorial Optimization | 2000-10-30 | Paper |
On minimal solutions of Diophantine equations
Beiträge zur Algebra und Geometrie | 2000-04-26 | Paper |
On minimal solutions of Diophantine equations
Beiträge zur Algebra und Geometrie | 2000-04-26 | Paper |
Test sets of integer programs
Mathematical Methods of Operations Research | 1999-08-22 | Paper |
The node capacitated graph partitioning problem: A computational study
Mathematical Programming. Series A. Series B | 1999-06-03 | Paper |
Truncated Gröbner bases for integer programming
Applicable Algebra in Engineering, Communication and Computing | 1999-06-01 | Paper |
A counterexample to an integer analogue of Carathéodory's theorem
Journal für die reine und angewandte Mathematik (Crelles Journal) | 1999-05-16 | Paper |
| scientific article; zbMATH DE number 1263288 (Why is no real title available?) | 1999-03-16 | Paper |
| scientific article; zbMATH DE number 1305542 (Why is no real title available?) | 1999-01-01 | Paper |
| scientific article; zbMATH DE number 1187156 (Why is no real title available?) | 1998-08-10 | Paper |
| scientific article; zbMATH DE number 1182577 (Why is no real title available?) | 1998-08-02 | Paper |
| scientific article; zbMATH DE number 1175943 (Why is no real title available?) | 1998-07-19 | Paper |
The Steiner tree packing problem in VLSI design
Mathematical Programming. Series A. Series B | 1998-06-22 | Paper |
The Sequential Knapsack Polytope
SIAM Journal on Optimization | 1998-05-12 | Paper |
A Variant of the Buchberger Algorithm for Integer Programming
SIAM Journal on Discrete Mathematics | 1997-05-20 | Paper |
Hilbert Bases and the Facets of Special Knapsack Polytopes
Mathematics of Operations Research | 1997-02-13 | Paper |
Solving Multiple Knapsack Problems by Cutting Planes
SIAM Journal on Optimization | 1997-02-03 | Paper |
Packing Steiner trees: A cutting plane algorithm and computational results
Mathematical Programming. Series A. Series B | 1997-01-06 | Paper |
Optimum path packing on wheels: The consecutive case
Computers & Mathematics with Applications | 1997-01-06 | Paper |
On the \(0/1\) knapsack polytope
Mathematical Programming. Series A. Series B | 1997-01-01 | Paper |
Formulations and valid inequalities of the node capacitated graph partitioning problem
Mathematical Programming. Series A. Series B | 1996-10-31 | Paper |
Packing Steiner Trees: Separation Algorithms
SIAM Journal on Discrete Mathematics | 1996-10-03 | Paper |
Packing Steiner trees: Further facets
European Journal of Combinatorics | 1996-07-14 | Paper |
Routing in grid graphs by cutting planes
ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research | 1996-05-30 | Paper |
Gröbner bases of lattices, corner polyhedra, and integer programming
Beiträge zur Algebra und Geometrie | 1996-01-01 | Paper |
Gröbner bases of lattices, corner polyhedra, and integer programming
Beiträge zur Algebra und Geometrie | 1996-01-01 | Paper |
Packing Steiner trees: Polyhedral investigations
Mathematical Programming. Series A. Series B | 1996-01-01 | Paper |
Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
Mathematical Programming. Series A. Series B | 1994-12-01 | Paper |
| scientific article; zbMATH DE number 508829 (Why is no real title available?) | 1994-05-24 | Paper |
Some integer programs arising in the design of main frame computers
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research | 1993-09-21 | Paper |
| scientific article; zbMATH DE number 108283 (Why is no real title available?) | 1993-01-23 | Paper |
