| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 6863837 (Why is no real title available?) | 2018-04-23 | Paper |
Facet generating techniques Research Trends in Combinatorial Optimization | 2017-04-07 | Paper |
Edmonds, matching and the birth of polyhedral combinatorics Documenta Mathematica | 2013-04-17 | Paper |
Traces of the XII Aussois Workshop on combinatorial optimization Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Traveling the boundary of Minkowski sums. Information Processing Letters | 2006-01-17 | Paper |
On the capacitated vehicle routing problem Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
On the submodular matrix representation of a digraph. Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1263275 (Why is no real title available?) | 2000-10-10 | Paper |
Column generation and the airline crew pairing problem Documenta Mathematica | 1998-08-06 | Paper |
Column generation and the airline crew pairing problem Documenta Mathematica | 1998-08-06 | Paper |
| scientific article; zbMATH DE number 1102774 (Why is no real title available?) | 1998-01-12 | Paper |
| scientific article; zbMATH DE number 863471 (Why is no real title available?) | 1997-07-08 | Paper |
New primal and dual matching heuristics Algorithmica | 1995-05-30 | Paper |
The precedence-constrained asymmetric traveling salesman polytope Mathematical Programming. Series A. Series B | 1995-05-28 | Paper |
Outer-Facial Graphs and the Traveling Salesman Problem SIAM Journal on Optimization | 1995-05-09 | Paper |
A nonlinear allocation problem IBM Journal of Research and Development | 1995-03-16 | Paper |
Two Steiner tree packing problems Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 | 1995-01-01 | Paper |
| scientific article; zbMATH DE number 176878 (Why is no real title available?) | 1993-05-18 | Paper |
A network penalty method Mathematical Programming. Series A. Series B | 1992-06-25 | Paper |
Minimum-weight two-connected spanning networks Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
Optimizing over the subtour polytope of the travelling salesman problem Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
König-Egerváry graphs, 2-bicritical graphs and fractional matchings Discrete Applied Mathematics | 1989-01-01 | Paper |
The maximum size of a convex polygon in a restricted set of points in the plane Discrete & Computational Geometry | 1989-01-01 | Paper |
Hybrid triple systems and cubic feedback sets Graphs and Combinatorics | 1989-01-01 | Paper |
The perfectly matchable subgraph polytope of an arbitrary graph Combinatorica | 1989-01-01 | Paper |
Forest covers and a polyhedral intersection theorem Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
Cutting disjoint disks by straight lines Discrete & Computational Geometry | 1989-01-01 | Paper |
On cycle cones and polyhedra Linear Algebra and its Applications | 1989-01-01 | Paper |
On cycle cones and polyhedra Linear Algebra and its Applications | 1989-01-01 | Paper |
Matroid Steiner problems, the Tutte polynomial and network reliability Journal of Combinatorial Theory. Series B | 1989-01-01 | Paper |
Odd path packings European Journal of Combinatorics | 1989-01-01 | Paper |
TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer Operations Research Letters | 1987-01-01 | Paper |
Linear Systems for Constrained Matching Problems Mathematics of Operations Research | 1987-01-01 | Paper |
Exact arborescences, matchings and cycles Discrete Applied Mathematics | 1987-01-01 | Paper |
Fractional matchings and the Edmonds-Gallai theorem Discrete Applied Mathematics | 1987-01-01 | Paper |
Clique Tree Inequalities and the Symmetric Travelling Salesman Problem Mathematics of Operations Research | 1986-01-01 | Paper |
The traveling salesman problem in graphs with 3-edge cutsets Journal of the ACM | 1985-01-01 | Paper |
Steiner trees, connected domination and strongly chordal graphs Networks | 1985-01-01 | Paper |
On partitioning the edges of graphs into connected subgraphs Journal of Graph Theory | 1985-01-01 | Paper |
Eulerian Orientations and Circulations SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
Random near-regular graphs and the node packing problem Operations Research Letters | 1985-01-01 | Paper |
Minimizing setups in ordered sets of fixed width Order | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3873377 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3849282 (Why is no real title available?) | 1984-01-01 | Paper |
Hamiltonicity in (0-1)-polyhedra Journal of Combinatorial Theory. Series B | 1984-01-01 | Paper |
Balanced optimization problems Operations Research Letters | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3904331 (Why is no real title available?) | 1983-01-01 | Paper |
Halin graphs and the travelling salesman problem Mathematical Programming | 1983-01-01 | Paper |
The perfectly matchable subgraph polytope of a bipartite graph Networks | 1983-01-01 | Paper |
Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem Combinatorica | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3924538 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3790462 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3790476 (Why is no real title available?) | 1982-01-01 | Paper |
Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings North-Holland Mathematics Studies | 1982-01-01 | Paper |
Brick decompositions and the matching rank of graphs Combinatorica | 1982-01-01 | Paper |
Packing subgraphs in a graph Operations Research Letters | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3779123 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3750980 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3751015 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3752883 (Why is no real title available?) | 1981-01-01 | Paper |
Hamiltonicity and combinatorial polyhedra Journal of Combinatorial Theory. Series B | 1981-01-01 | Paper |
Weakly bipartite graphs and the max-cut problem Operations Research Letters | 1981-01-01 | Paper |
Matchings in regular graphs Discrete Mathematics | 1981-01-01 | Paper |
Total dual integrality and b-matchings Operations Research Letters | 1981-01-01 | Paper |
A matching problem with side conditions Discrete Mathematics | 1980-01-01 | Paper |
Perfect triangle-free 2-matchings Mathematical Programming Studies | 1980-01-01 | Paper |
Dual integrality in b-matching problems Mathematical Programming Studies | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3637599 (Why is no real title available?) | 1979-01-01 | Paper |
A note on graphs spanned by Eulerian graphs Journal of Graph Theory | 1979-01-01 | Paper |
Minimum node covers and 2-bicritical graphs Mathematical Programming | 1979-01-01 | Paper |
Total dual integrality and integer polyhedra Linear Algebra and its Applications | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3505020 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3561360 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3496213 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3499169 (Why is no real title available?) | 1973-01-01 | Paper |