| Publication | Date of Publication | Type |
|---|
| Binary matrix factorization and completion via integer programming | 2024-06-27 | Paper |
| Special issue: International symposium on mathematical programming 2022 | 2023-06-23 | Paper |
| Recovering Dantzig-Wolfe Bounds by Cutting Planes | 2023-01-30 | Paper |
| Multilinear sets with two monomials and cardinality constraints | 2022-11-11 | Paper |
| On a Generalization of the Chvátal-Gomory Closure | 2022-10-14 | Paper |
| On a generalization of the Chvátal-Gomory closure | 2022-03-22 | Paper |
| Generalized Chvátal-Gomory closures for integer programs with bounds on variables | 2021-10-20 | Paper |
| Optimal decision trees for categorical data via integer programming | 2021-08-17 | Paper |
| Cardinality constrained multilinear sets | 2021-02-04 | Paper |
| Convexifying Multilinear Sets with Cardinality Constraints: Structural Properties, Nested Case and Extensions | 2020-07-30 | Paper |
| Lattice closures of polyhedra | 2020-06-10 | Paper |
| A note on capacity models for network design | 2019-06-11 | Paper |
| Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods | 2018-11-09 | Paper |
| Binary extended formulations of polyhedral mixed-integer sets | 2018-07-13 | Paper |
| On the relative strength of different generalizations of split cuts | 2018-05-24 | Paper |
| A new lift-and-project operator | 2018-05-24 | Paper |
| Binary Extended Formulations | 2018-01-03 | Paper |
| On Capacity Models for Network Design | 2017-11-28 | Paper |
| On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width | 2017-07-27 | Paper |
| Multi-Commodity Multi-Facility Network Design | 2017-07-12 | Paper |
| Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse | 2017-06-02 | Paper |
| Cutting planes from extended LP formulations | 2017-02-03 | Paper |
| On the polyhedrality of cross and quadrilateral closures | 2016-11-25 | Paper |
| A time bucket formulation for the traveling salesman problem with time windows | 2016-06-29 | Paper |
| The continuous knapsack set | 2016-02-23 | Paper |
| Discretization vertex orders in distance geometry | 2015-09-30 | Paper |
| Computational Experiments with Cross and Crooked Cross Cuts | 2015-01-26 | Paper |
| Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming | 2014-06-27 | Paper |
| On \(t\)-branch split cuts for mixed-integer programs | 2013-11-11 | Paper |
| On Some Generalizations of the Split Closure | 2013-03-19 | Paper |
| Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra | 2012-10-15 | Paper |
| Two-step MIR inequalities for mixed integer programs | 2012-07-28 | Paper |
| Perspective Reformulation and Applications | 2012-07-10 | Paper |
| A Polytope for a Product of Real Linear Functions in 0/1 Variables | 2012-07-10 | Paper |
| Strengthening lattice-free cuts using non-negativity | 2012-06-20 | Paper |
| The master equality polyhedron with multiple rows | 2012-04-27 | Paper |
| On mixed-integer sets with two integer variables | 2012-04-05 | Paper |
| A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions | 2012-02-21 | Paper |
| A note on the MIR closure and basic relaxations of polyhedra | 2011-08-19 | Paper |
| On a generalization of the master cyclic group polyhedron | 2010-10-13 | Paper |
| Perspective reformulations of mixed integer nonlinear programs with indicator variables | 2010-09-16 | Paper |
| On mixing inequalities: rank, closure, and cutting-plane proofs | 2010-06-01 | Paper |
| Mingling: mixed-integer rounding with bounds | 2010-04-15 | Paper |
| Erratum to: MIR closures of polyhedral sets | 2010-04-15 | Paper |
| MIR closures of polyhedral sets | 2010-02-19 | Paper |
| A pricing problem under Monge property | 2008-10-29 | Paper |
| On the strength of Gomory mixed-integer cuts as group cuts | 2008-10-16 | Paper |
| Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables | 2008-06-10 | Paper |
| A New Min‐Cut Max‐Flow Ratio for Multicommodity Flows | 2008-03-28 | Paper |
| On the MIR Closure of Polyhedra | 2007-11-29 | Paper |
| On a Generalization of the Master Cyclic Group Polyhedron | 2007-11-29 | Paper |
| Network design arc set with variable upper bounds | 2007-07-20 | Paper |
| Valid inequalities based on the interpolation procedure | 2006-05-02 | Paper |
| Valid inequalities based on simple mixed-integer sets | 2006-01-13 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Reformulating linear programs with transportation constraints-With applications to workforce scheduling | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737516 | 2004-08-11 | Paper |
| An integer programming model for the weekly tour scheduling problem | 2002-03-14 | Paper |
| Mixing mixed-integer inequalities | 2001-01-01 | Paper |
| Minimum cost capacity installation for multicommodity network flows | 1999-10-18 | Paper |
| A branch-and-cut algorithm for capacitated network design problems | 1999-01-01 | Paper |
| Capacitated Network Design—Polyhedral Structure and Computation | 1997-01-15 | Paper |
| Computational experience with a difficult mixed-integer multicommodity flow problem | 1996-04-18 | Paper |
| A degree sequence problem related to network design | 1994-08-29 | Paper |
