| Publication | Date of Publication | Type |
|---|
| When Lift-and-Project Cuts Are Different | 2021-01-07 | Paper |
| Partial hyperplane activation for generalized intersection cuts | 2020-04-29 | Paper |
| Implementation of a linear time algorithm for certain generalized traveling salesman problems | 2019-01-11 | Paper |
| Disjunctive Programming | 2018-10-02 | Paper |
| Erratum to ``Intersection cuts -- standard versus restricted | 2018-08-17 | Paper |
| Intersection cuts -- standard versus restricted | 2018-05-24 | Paper |
| On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts | 2016-11-25 | Paper |
| Intersection cuts from multiple rows: a disjunctive programming approach | 2014-09-30 | Paper |
| Generalized intersection cuts and a new cut generating paradigm | 2013-03-18 | Paper |
| A hard integer program made easy by lexicography | 2012-10-15 | Paper |
| Monoidal cut strengthening revisited | 2012-07-12 | Paper |
| Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study | 2012-05-30 | Paper |
| Der Wille zur Freiheit | 2012-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113643 | 2012-01-19 | Paper |
| Lexicography and degeneracy: Can a pure cutting plane algorithm work? | 2011-11-23 | Paper |
| Projecting systems of linear inequalities with binary variables | 2011-11-17 | Paper |
| Some thoughts on the development of integer programming during my research career | 2011-05-20 | Paper |
| On the Cycle Polytope of a Directed Graph and Its Relaxations | 2011-04-07 | Paper |
| On the cycle polytope of a directed graph and its relaxations | 2010-11-24 | Paper |
| On the enumerative nature of Gomory's dual cutting plane method | 2010-11-22 | Paper |
| Disjunctive Programming | 2010-06-03 | Paper |
| Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants | 2009-12-09 | Paper |
| Job shop scheduling with setup times, deadlines and precedence constraints | 2009-08-28 | Paper |
| Octane: A New Heuristic for Pure 0–1 Programs | 2009-07-03 | Paper |
| Can Pure Cutting Plane Algorithms Work? | 2008-06-10 | Paper |
| Optimizing over the split closure | 2008-03-12 | Paper |
| New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing | 2007-11-29 | Paper |
| New facets of the STS polytope generated from known facets of the ATS polytope | 2006-06-30 | Paper |
| Projection, lifting and extended formulation integer and combinatorial optimization | 2006-03-07 | Paper |
| Pivot and shift -- a mixed integer programming heuristic | 2005-08-22 | Paper |
| The vertex separator problem: algorithms and computations | 2005-08-08 | Paper |
| The vertex separator problem: a polyhedral investigation | 2005-08-08 | Paper |
| Logical constraints as cardinality rules: Tight representation | 2005-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4735936 | 2004-08-09 | Paper |
| On unions and dominants of polytopes | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461905 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461916 | 2004-05-18 | Paper |
| A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming | 2003-10-29 | Paper |
| Some thoughts on the development of integer programming during my research career - lecture delivered upon receiving the EURO Gold medal, July 9, 2001, Rotterdam | 2002-11-13 | Paper |
| Lift-and-project for mixed 0-1 programming: recent progress | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537754 | 2002-06-20 | Paper |
| Guided Local Search with Shifting Bottleneck for Job Shop Scheduling | 2002-04-17 | Paper |
| Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem | 2001-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4509381 | 2000-10-15 | Paper |
| Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems | 1999-08-08 | Paper |
| New classes of efficiently solvable generalized traveling salesman problems | 1999-06-10 | Paper |
| Disjunctive programming: Properties of the convex hull of feasible points | 1999-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234130 | 1999-03-16 | Paper |
| On the dimension of projected polyhedra | 1998-11-29 | Paper |
| Projection with a minimal system of inequalities | 1998-09-20 | Paper |
| Recognizing facet defining inequalities | 1998-09-20 | Paper |
| A modified lift-and-project procedure | 1998-05-25 | Paper |
| Job shop scheduling with deadlines | 1998-04-13 | Paper |
| On the monotonization of polyhedra | 1997-11-25 | Paper |
| Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework | 1997-11-12 | Paper |
| Robert G. Jeroslow 1942-1988 | 1997-08-21 | Paper |
| A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering | 1997-08-03 | Paper |
| Gomory cuts revisited | 1997-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5687248 | 1997-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5687247 | 1996-12-11 | Paper |
| The prize collecting traveling salesman problem: II. Polyhedral results | 1996-08-19 | Paper |
| Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring | 1996-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840110 | 1995-07-18 | Paper |
| The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling | 1995-07-04 | Paper |
| The precedence-constrained asymmetric traveling salesman polytope | 1995-05-28 | Paper |
| A parallel shortest augmenting path algorithm for the assignment problem | 1994-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140425 | 1993-12-15 | Paper |
| Linear-time separation algorithms for the three-index assignment polytope | 1993-08-17 | Paper |
| A lift-and-project cutting plane algorithm for mixed 0-1 programs | 1993-08-17 | Paper |
| A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets | 1993-08-17 | Paper |
| The Fixed-Outdegree 1-Arborescence Polytope | 1993-03-01 | Paper |
| Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs | 1992-12-06 | Paper |
| An Algorithm for the Three-Index Assignment Problem | 1992-06-26 | Paper |
| Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs | 1991-01-01 | Paper |
| The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph | 1989-01-01 | Paper |
| On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\) | 1989-01-01 | Paper |
| The perfectly matchable subgraph polytope of an arbitrary graph | 1989-01-01 | Paper |
| On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) | 1989-01-01 | Paper |
| Sequential convexification in reverse convex and disjunctive programming | 1989-01-01 | Paper |
| Facets of the three-index assignment polytope | 1989-01-01 | Paper |
| On graphs with polynomially solvable maximum-weight clique problem | 1989-01-01 | Paper |
| The prize collecting traveling salesman problem | 1989-01-01 | Paper |
| On the convex hull of the union of certain polyhedra | 1988-01-01 | Paper |
| The Shifting Bottleneck Procedure for Job Shop Scheduling | 1988-01-01 | Paper |
| Comment on 'Some computational results on real 0-1 knapsack problems' | 1987-01-01 | Paper |
| On the Maximum Weight Clique Problem | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3808112 | 1987-01-01 | Paper |
| A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring | 1986-01-01 | Paper |
| Finding a Maximum Clique in an Arbitrary Graph | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686500 | 1985-01-01 | Paper |
| On the facial structure of scheduling polyhedra | 1985-01-01 | Paper |
| Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems | 1985-01-01 | Paper |
| Nonlinear 0–1 programming: I. Linearization techniques | 1984-01-01 | Paper |
| Nonlinear 0–1 programming: II. Dominance relations and algorithms | 1984-01-01 | Paper |
| A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3340498 | 1984-01-01 | Paper |
| Traffic assignment in communication satellites | 1983-01-01 | Paper |
| Bender's method revisited | 1983-01-01 | Paper |
| Correction to Disjunctive programming | 1983-01-01 | Paper |
| The perfectly matchable subgraph polytope of a bipartite graph | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3037131 | 1982-01-01 | Paper |
| A restricted Lagrangean approach to the traveling salesman problem | 1981-01-01 | Paper |
| Integer and Fractional Matchings | 1981-01-01 | Paper |
| Strengthening cuts for mixed integer programs | 1980-01-01 | Paper |
| Cutting planes from conditional bounds: A new approach to set covering | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3880587 | 1980-01-01 | Paper |
| Pivot and Complement–A Heuristic for 0-1 Programming | 1980-01-01 | Paper |
| An Algorithm for Large Zero-One Knapsack Problems | 1980-01-01 | Paper |
| Adjacent vertices of the all 0-1 programming polytope | 1979-01-01 | Paper |
| Disjunctive Programming | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048579 | 1979-01-01 | Paper |
| Facets of the Knapsack Polytope From Minimal Covers | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132008 | 1977-01-01 | Paper |
| Graph substitution and set packing polytopes | 1977-01-01 | Paper |
| A node covering algorithm | 1977-01-01 | Paper |
| A note on duality in disjunctive programming | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3892882 | 1977-01-01 | Paper |
| Set Partitioning: A survey | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4120336 | 1976-01-01 | Paper |
| Intersection cuts from outer polars of truncated cubes | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4120330 | 1975-01-01 | Paper |
| Nonconvex Quadratic Programming via Generalized Polars | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4068474 | 1975-01-01 | Paper |
| Facets of the knapsack polytope | 1975-01-01 | Paper |
| On the Set-Covering Problem: II. An Algorithm for Set Partitioning | 1975-01-01 | Paper |
| Technical Note—A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case | 1973-01-01 | Paper |
| Canonical Cuts on the Unit Hypercube | 1972-01-01 | Paper |
| On the Set-Covering Problem | 1972-01-01 | Paper |
| Integer programming and convex analysis: Intersection cuts from outer polars | 1972-01-01 | Paper |
| Ranking the facets of the octahedron | 1972-01-01 | Paper |
| Intersection Cuts—A New Type of Cutting Planes for Integer Programming | 1971-01-01 | Paper |
| An Intersection Cut from the Dual of the Unit Hypercube | 1971-01-01 | Paper |
| A duality theorem and an algorithm for (mixed-) integer nonlinear programming | 1971-01-01 | Paper |
| Machine sequencing: Disjunctive graphs and degree-constrained subgraphs | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5627917 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4116288 | 1970-01-01 | Paper |
| Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm | 1969-01-01 | Paper |
| Duality in Discrete Programming: II. The Quadratic Case | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5540129 | 1968-01-01 | Paper |
| Letter to the Editor—A Note on the Branch-and-Bound Principle | 1968-01-01 | Paper |
| Discrete Programming by the Filter Method | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5540127 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5540128 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5677310 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5343961 | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5510353 | 1966-01-01 | Paper |
| The Dual Method for the Generalized Transportation Problem | 1966-01-01 | Paper |
| An Infeasibility-Pricing Decomposition Method for Linear Programs | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5343958 | 1965-01-01 | Paper |
| An Additive Algorithm for Solving Linear Programs with Zero-One Variables | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5508055 | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5508056 | 1965-01-01 | Paper |
| Solution of Large-Scale Transportation Problems Through Aggregation | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5516540 | 1965-01-01 | Paper |
| An Additive Algorithm for Solving Linear Programs with Zero-One Variables | 1965-01-01 | Paper |
| On the Generalized Transportation Problem | 1964-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5561614 | 1964-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5608997 | 1964-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5728875 | 1963-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5724372 | 1962-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3294639 | 1962-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5328554 | 1961-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5557609 | 1961-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5557610 | 1961-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5727215 | 1961-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5557608 | 1960-01-01 | Paper |
