| Characterization of facets of the hop constrained chain polytope via dynamic programming | 0 | 0.34 | 2014 |
| Mathematical methods for physical layout of printed circuit boards: an overview | 3 | 0.49 | 2008 |
| George Dantzig's contributions to integer programming | 5 | 0.41 | 2008 |
| A Column-Generation Approach to Line Planning in Public Transport | 44 | 3.12 | 2007 |
| Polynomial inequalities representing polyhedra | 3 | 0.63 | 2005 |
| The Representation of Polyhedra by Polynomial Inequalities | 3 | 1.02 | 2003 |
| Online-Dispatching of Automobile Service Units. | 0 | 0.34 | 2002 |
| Panel: Legal Aspects of Information Systems | 0 | 0.34 | 2001 |
| Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut | 68 | 3.45 | 2001 |
| Cooperative Scientific Digital Libraries | 0 | 0.34 | 2001 |
| A polyhedral study of the asymmetric traveling salesman problem with time windows | 54 | 4.59 | 2000 |
| Design of Broadband Virtual Private Networks: Model and Heuristics for the B-WiN | 12 | 2.83 | 1998 |
| Neue Produkte - die Funktionen der Beteiligten | 0 | 0.34 | 1995 |
| Polyhedral And Computational Investigations For Designing Communication Networks With High Survivability Requirements | 28 | 1.84 | 1995 |
| Some integer programs arising in the design of main frame computers | 5 | 0.78 | 1993 |
| Routing in grid graphs by cutting planes | 5 | 0.84 | 1993 |
| Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints | 80 | 7.07 | 1992 |
| Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints | 44 | 3.59 | 1992 |
| Solution of large-scale symmetric travelling salesman problems | 82 | 17.93 | 1991 |
| Complete Descriptions of Small Multicut Polytopes. | 11 | 0.90 | 1990 |
| On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem | 9 | 2.93 | 1990 |
| Integer polyhedra arising from certain network design problems with connectivity constraints | 63 | 8.49 | 1990 |
| Polyhedral Approaches to Network Survivability. | 27 | 2.12 | 1989 |
| An application of combinatorial optimization to statistical physics and circuit layout design | 41 | 13.39 | 1988 |
| A cutting plane algorithm for minimum perfect 2-matchings | 18 | 3.97 | 1987 |
| On the acyclic subgraph polytope. | 46 | 6.19 | 1985 |
| Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization | 15 | 1.82 | 1984 |
| A polynomial algorithm for the max-cut problem on graphs without long odd cycles. | 15 | 6.74 | 1984 |
| Mathematical Programming The State of the Art, XIth International Symposium on Mathematical Programming, Bonn, Germany, August 23-27, 1982. | 1 | 0.51 | 1983 |
| The ellipsoid method and its consequences in combinatorial optimization. | 797 | 569.02 | 1981 |
| On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets | 3 | 0.67 | 1981 |
| Hypotraceable digraphs. | 1 | 0.38 | 1980 |
| On the symmetric travelling salesman problem I: Inequalities. | 75 | 35.70 | 1979 |
| The graphs for which all strong orientations are hamiltonian. | 2 | 0.98 | 1979 |
| Buchbesprechungen. | 0 | 0.34 | 1979 |
| A property of continuous unbounded algorithms. | 0 | 0.34 | 1978 |
| Lineare Charakterisierungen von Travelling Salesman Problemen | 8 | 10.34 | 1977 |
| Partial linear characterizations of the asymmetric travelling salesman polytope | 2 | 9.43 | 1975 |
