| Publication | Date of Publication | Type |
|---|
| Facets and Rank of Integer Polyhedra | 2015-07-22 | Paper |
| The rank of (mixed-) integer polyhedra | 2013-03-18 | Paper |
| Mixed-integer programming -- 1968 and thereafter | 2011-05-20 | Paper |
| Classical cuts for mixed-integer programming and branch-and-cut | 2006-03-07 | Paper |
| The Finite Sample Breakdown Point of \boldmath$\ell_1$-Regression | 2005-02-23 | Paper |
| Least trimmed squares regression, least median squares regression, and mathematical program\-ming | 2004-08-20 | Paper |
| Classical cuts for mixed-integer programming and branch-and-cut | 2003-07-15 | Paper |
| Alternative methods of linear regression | 2002-08-15 | Paper |
| Optimal project selection when borrowing and lending rates differ | 2002-05-05 | Paper |
| Almost Perfect Matrices and Graphs | 2001-11-26 | Paper |
| Linear optimization and extensions. Problems and solutions | 2001-07-12 | Paper |
| Approximating separable nonlinear functions via mixed zero-one programs | 2000-12-20 | Paper |
| Packing small boxes into a big box. | 2000-01-01 | Paper |
| Linear optimization and extensions. | 1999-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4353151 | 1997-12-11 | Paper |
| An analytic symmetrization of max flow-min cut | 1997-06-10 | Paper |
| Location, scheduling, design and integer programming | 1997-02-16 | Paper |
| Linear optimization and extensions | 1995-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4287995 | 1994-04-19 | Paper |
| Solving Airline Crew Scheduling Problems by Branch-and-Cut | 1994-03-17 | Paper |
| Boolean polynomials and set functions | 1994-01-02 | Paper |
| Lehman's forbidden minor characterization of ideal 0-1 matrices | 1993-12-20 | Paper |
| Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut | 1993-02-18 | Paper |
| An analytical comparison of different formulations of the travelling salesman problem | 1992-06-27 | Paper |
| A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems | 1991-01-01 | Paper |
| Facet identification for the symmetric traveling salesman polytope | 1990-01-01 | Paper |
| The Boolean quadratic polytope: Some characteristics, facets and relatives | 1989-01-01 | Paper |
| The complexity of matching with bonds | 1989-01-01 | Paper |
| Total unimodularity and the Euler-subgraph problem | 1988-01-01 | Paper |
| A polynomial-time solution to Papadimitriou and Steiglitz's ``traps | 1988-01-01 | Paper |
| Branch-and-cut approach to a variant of the traveling salesman problem | 1988-01-01 | Paper |
| A different convergence proof of the projective method for linear programming | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686494 | 1985-01-01 | Paper |
| Valid Linear Inequalities for Fixed Charge Problems | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3714900 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3714901 | 1985-01-01 | Paper |
| Fractional covers for forests and matchings | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3677793 | 1984-01-01 | Paper |
| Trees and Cuts | 1983-01-01 | Paper |
| Solving Large-Scale Zero-One Linear Programming Problems | 1983-01-01 | Paper |
| Degree-two Inequalities, Clique Facets, and Biperfect Graphs | 1982-01-01 | Paper |
| A note on the knapsack problem with special ordered sets | 1981-01-01 | Paper |
| (1,k)-configurations and facets for packing problems | 1980-01-01 | Paper |
| On the symmetric travelling salesman problem: A computational study | 1980-01-01 | Paper |
| Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048579 | 1979-01-01 | Paper |
| On the symmetric travelling salesman problem I: Inequalities | 1979-01-01 | Paper |
| On the symmetric travelling salesman problem II: Lifting theorems and facets | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3865830 | 1979-01-01 | Paper |
| Adjacent vertices of the all 0-1 programming polytope | 1979-01-01 | Paper |
| Covering, Packing and Knapsack Problems | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206661 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4168779 | 1978-01-01 | Paper |
| Lineare Charakterisierungen von Travelling Salesman Problemen | 1977-01-01 | Paper |
| Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4182528 | 1977-01-01 | Paper |
| A note on the total unimodularity of matrices | 1976-01-01 | Paper |
| Almost integral polyhedra related to certain combinatorial optimization problems | 1976-01-01 | Paper |
| Set Partitioning: A survey | 1976-01-01 | Paper |
| Constraint Pairing In Integer Programming | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4068474 | 1975-01-01 | Paper |
| Technical Note—A Note on Zero-One Programming | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4077730 | 1975-01-01 | Paper |
| On the Set-Covering Problem: II. An Algorithm for Set Partitioning | 1975-01-01 | Paper |
| Partial linear characterizations of the asymmetric travelling salesman polytope | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4074669 | 1974-01-01 | Paper |
| The Triangular E-Model of Chance-Constrained Programming with Stochastic A-Matrix | 1974-01-01 | Paper |
| Perfect zero–one matrices | 1974-01-01 | Paper |
| On the facial structure of set packing polyhedra | 1973-01-01 | Paper |
| Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach | 1972-01-01 | Paper |
| On the Set-Covering Problem | 1972-01-01 | Paper |
| A Remark on “an Inequality for the Number of Lattice Points in a Simplex” | 1971-01-01 | Paper |
