| Publication | Date of Publication | Type |
|---|
| Approximately Packing Dijoins via Nowhere-Zero Flows | 2023-11-07 | Paper |
| Arc connectivity and submodular flows in digraphs | 2023-10-30 | Paper |
| On Packing Dijoins in Digraphs and Weighted Digraphs | 2023-10-26 | Paper |
| Dyadic linear programming and extensions | 2023-09-08 | Paper |
| Testing idealness in the filter oracle model | 2022-12-12 | Paper |
| Idealness of k-wise Intersecting Families | 2022-10-14 | Paper |
| On Dyadic Fractional Packings of $T$-Joins | 2022-10-06 | Paper |
| A mickey-mouse decomposition theorem | 2022-08-30 | Paper |
| Combining and strengthening Gomory cuts | 2022-08-30 | Paper |
| Total dual dyadicness and dyadic generating sets | 2022-08-16 | Paper |
| Clean Clutters and Dyadic Fractional Packings | 2022-04-20 | Paper |
| Idealness of \(k\)-wise intersecting families | 2022-03-22 | Paper |
| Correction to: ``Idealness of \(k\)-wise intersecting families | 2022-03-22 | Paper |
| Clean tangled clutters, simplices, and projective geometries | 2022-03-03 | Paper |
| Testing idealness in the filter oracle model | 2022-02-15 | Paper |
| Decomposition of integer programs and of generating sets | 2021-12-20 | Paper |
| A new infinite class of ideal minimally non-packing clutters | 2021-06-14 | Paper |
| Resistant Sets in the Unit Hypercube | 2021-06-03 | Paper |
| Intersecting restrictions in clutters | 2021-03-20 | Paper |
| The max-flow min-cut property and \(\pm 1\)-resistant sets | 2020-12-29 | Paper |
| Cuboids, a class of clutters | 2020-04-07 | Paper |
| Ideal Clutters That Do Not Pack | 2020-03-12 | Paper |
| Idealness and 2-resistant sets | 2020-02-10 | Paper |
| Identically self-blocking clutters | 2020-02-06 | Paper |
| On the rational polytopes with Chvátal rank 1 | 2020-01-17 | Paper |
| When the Gomory-chvátal closure coincides with the integer hull | 2019-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633937 | 2019-05-06 | Paper |
| From estimation to optimization via shrinkage | 2019-02-22 | Paper |
| Optimality certificates for convex minimization and Helly numbers | 2019-02-22 | Paper |
| On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank | 2018-10-26 | Paper |
| Disjunctive cuts for cross-sections of the second-order cone | 2018-09-28 | Paper |
| Optimization Methods in Finance | 2018-08-07 | Paper |
| Incorporating Black-Litterman Views in Portfolio Construction when Stock Returns are a Mixture of Normals | 2017-06-10 | Paper |
| Cut-Generating Functions for Integer Variables | 2016-11-16 | Paper |
| On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank | 2016-08-10 | Paper |
| Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point | 2016-08-10 | Paper |
| Sufficiency of cut-generating functions | 2015-08-31 | Paper |
| Cut-Generating Functions and S-Free Sets | 2015-05-29 | Paper |
| On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs | 2015-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2928710 | 2014-11-10 | Paper |
| On the safety of Gomory cut generators | 2014-10-06 | Paper |
| Integer Programming | 2014-10-02 | Paper |
| Cutting planes from two-term disjunctions | 2014-05-15 | Paper |
| A 3-slope theorem for the infinite relaxation in the plane | 2014-02-03 | Paper |
| Practical strategies for generating rank-1 split cuts in mixed-integer linear programming | 2013-11-28 | Paper |
| Unique lifting of integer variables in minimal inequalities | 2013-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2861546 | 2013-11-08 | Paper |
| Extended formulations in combinatorial optimization | 2013-08-08 | Paper |
| The Chvátal closure of generalized stable sets in bidirected graphs | 2013-07-19 | Paper |
| Lifting Gomory cuts with bounded variables | 2013-05-14 | Paper |
| The ongoing story of Gomory cuts | 2013-04-17 | Paper |
| Cut-Generating Functions | 2013-03-19 | Paper |
| Mixed-integer nonlinear programs featuring ``on/off constraints | 2012-09-27 | Paper |
| How tight is the corner relaxation? Insights gained from the stable set problem | 2012-09-11 | Paper |
| Experiments with Two-Row Cuts from Degenerate Tableaux | 2012-07-28 | Paper |
| A counterexample to a conjecture of Gomory and Johnson | 2012-06-26 | Paper |
| Early Estimates of the Size of Branch-and-Bound Trees | 2012-06-18 | Paper |
| K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau | 2012-05-30 | Paper |
| Intersection Cuts with Infinite Split Rank | 2012-05-24 | Paper |
| Unique Minimal Liftings for Simplicial Polytopes | 2012-05-24 | Paper |
| Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts | 2012-02-21 | Paper |
| A Geometric Perspective on Lifting | 2012-01-26 | Paper |
| Improved strategies for branching on general disjunctions | 2011-12-14 | Paper |
| A Probabilistic Analysis of the Strength of the Split and Triangle Closures | 2011-06-24 | Paper |
| Branching on general disjunctions | 2011-06-17 | Paper |
| Revival of the Gomory cuts in the 1990's | 2011-05-20 | Paper |
| Convex Sets and Minimal Sublinear Functions | 2011-05-06 | Paper |
| Minimal Valid Inequalities for Integer Constraints | 2011-04-27 | Paper |
| Maximal Lattice-Free Convex Sets in Linear Subspaces | 2011-04-27 | Paper |
| Minimal Inequalities for an Infinite Relaxation of Integer Programs | 2011-03-15 | Paper |
| On the relative strength of split, triangle and quadrilateral cuts | 2011-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3589871 | 2010-09-21 | Paper |
| On Lifting Integer Variables in Minimal Inequalities | 2010-06-22 | Paper |
| Equivalence between intersection cuts and the corner polyhedron | 2010-06-08 | Paper |
| Polyhedral Approaches to Mixed Integer Linear Programming | 2010-06-03 | Paper |
| Extended formulations in combinatorial optimization | 2010-05-21 | Paper |
| Stable sets, corner polyhedra and the Chvàtal closure | 2009-12-07 | Paper |
| On the facets of mixed integer programs with two integer variables and two constraints | 2009-07-24 | Paper |
| Lehman matrices | 2009-06-23 | Paper |
| A feasibility pump for mixed integer nonlinear programs | 2009-04-24 | Paper |
| An algorithmic framework for convex mixed integer nonlinear programs | 2008-10-29 | Paper |
| A note on the MIR closure | 2008-05-29 | Paper |
| On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints | 2008-04-15 | Paper |
| Projected Chvátal-Gomory cuts for mixed integer linear programs | 2008-03-12 | Paper |
| Valid inequalities for mixed integer linear programs | 2007-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5292088 | 2007-06-19 | Paper |
| Decomposing Berge graphs containing no proper wheel, long prism or their complements | 2007-05-08 | Paper |
| Optimization Methods in Finance | 2007-04-05 | Paper |
| Balanced matrices | 2006-10-30 | Paper |
| Recognizing Berge graphs | 2006-06-27 | Paper |
| A convex-analysis perspective on disjunctive cuts | 2006-06-14 | Paper |
| Odd Hole Recognition in Graphs of Bounded Clique Size | 2006-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465108 | 2005-08-22 | Paper |
| Split closure and intersection cuts | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667215 | 2005-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737523 | 2004-08-11 | Paper |
| Decomposition of odd-hole-free graphs by double star cutsets and 2-joins | 2004-08-06 | Paper |
| Square-free perfect graphs. | 2004-03-14 | Paper |
| The packing property. | 2004-02-18 | Paper |
| Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs | 2003-08-25 | Paper |
| A class of perfect graphs containing \(P_{6}\) | 2003-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4549225 | 2003-02-06 | Paper |
| Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour | 2003-01-05 | Paper |
| Balanced \(0,\pm 1\) matrices. I: Decomposition | 2002-12-10 | Paper |
| Balanced \(0,\pm 1\) matrices. II: Recognition algorithm | 2002-12-10 | Paper |
| A connection between cutting plane theory and the geometry of numbers | 2002-12-01 | Paper |
| Perfect graphs, partitionable graphs and cutsets | 2002-10-20 | Paper |
| Even-hole-free graphs part II: Recognition algorithm | 2002-09-29 | Paper |
| On dijoins | 2002-09-25 | Paper |
| Ideal clutters | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537736 | 2002-06-20 | Paper |
| On the rank of mixed 0,1 polyhedra. | 2002-06-18 | Paper |
| Even-hole-free graphs part I: Decomposition theorem | 2002-06-02 | Paper |
| On Padberg's conjecture about almost totally unimodular matrices | 2001-11-07 | Paper |
| Elementary closures for integer programs. | 2001-07-12 | Paper |
| Combinatorial Optimization | 2001-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500707 | 2001-01-23 | Paper |
| Perfect, ideal and balanced matrices | 2001-01-01 | Paper |
| Balanced cycles and holes in bipartite graphs | 2000-07-05 | Paper |
| Even and odd holes in cap-free graphs | 1999-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840366 | 1999-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840342 | 1999-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228441 | 1999-03-01 | Paper |
| A Class of Hard Small 0-1 Programs | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398363 | 1998-07-19 | Paper |
| A class of logic problems solvable by linear programming | 1998-01-28 | Paper |
| Universally signable graphs | 1998-01-05 | Paper |
| Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework | 1997-11-12 | Paper |
| Gomory cuts revisited | 1997-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335200 | 1997-06-02 | Paper |
| Perfect \(0,\pm 1\) matrices | 1997-05-14 | Paper |
| Perfect matchings in balanced hypergraphs | 1997-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5687247 | 1996-12-11 | Paper |
| Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality | 1996-09-18 | Paper |
| From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes | 1994-10-31 | Paper |
| Ideal 0, 1 matrices | 1994-06-06 | Paper |
| Complete multi-partite cutsets in minimal imperfect graphs | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140425 | 1993-12-15 | Paper |
| Polyhedral study of the capacitated vehicle routing problem | 1993-11-01 | Paper |
| A lift-and-project cutting plane algorithm for mixed 0-1 programs | 1993-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3351135 | 1990-01-01 | Paper |
| A projection method for the uncapacitated facility location problem | 1990-01-01 | Paper |
| On the 0,1 facets of the set covering polytope | 1989-01-01 | Paper |
| General factors of graphs | 1988-01-01 | Paper |
| A matroid algorithm and its application to the efficient solution of two optimization problems on graphs | 1988-01-01 | Paper |
| An algorithmic framework for the matching problem in some hypergraphs | 1987-01-01 | Paper |
| Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem. A correction | 1987-01-01 | Paper |
| TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer | 1987-01-01 | Paper |
| Two algorithms for weighted matroid intersection | 1986-01-01 | Paper |
| An extension of matching theory | 1986-01-01 | Paper |
| The traveling salesman problem on a graph and some related integer polyhedra | 1985-01-01 | Paper |
| The traveling salesman problem in graphs with 3-edge cutsets | 1985-01-01 | Paper |
| Compositions for perfect graphs | 1985-01-01 | Paper |
| Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem | 1984-01-01 | Paper |
| Halin graphs and the travelling salesman problem | 1983-01-01 | Paper |
| Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698661 | 1982-01-01 | Paper |
| Some facets of the simple plant location polytope | 1982-01-01 | Paper |
| A Primal Approach to the Simple Plant Location Problem | 1982-01-01 | Paper |
| Packing subgraphs in a graph | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3934441 | 1981-01-01 | Paper |
| Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem | 1980-01-01 | Paper |
| Perfect triangle-free 2-matchings | 1980-01-01 | Paper |
| A Canonical Representation of Simple Plant Location Problems and Its Applications | 1980-01-01 | Paper |
| A matching problem with side conditions | 1980-01-01 | Paper |
| Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms” | 1979-01-01 | Paper |
| Tight bounds for christofides' traveling salesman heuristic | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132252 | 1977-01-01 | Paper |
| Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms | 1977-01-01 | Paper |
