| Publication | Date of Publication | Type |
|---|
| Traces of the XII Aussois Workshop on combinatorial optimization | 2010-09-16 | Paper |
| The Optimal Diversity Management Problem | 2009-07-14 | Paper |
| Greedy approach and multi-criteria simulated annealing for the car sequencing problem | 2008-07-10 | Paper |
| The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation | 2008-05-27 | Paper |
| Combinatorial optimization: Theory and computation. The Aussois Workshop 2004. Introduction | 2006-01-13 | Paper |
| The Symmetric Traveling Salesman Polytope Revisited | 2005-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465114 | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461904 | 2004-05-18 | Paper |
| The domino inequalities: facets for the symmetric traveling salesman polytope | 2004-03-11 | Paper |
| The Aussois 2000 workshop in combinatorial optimization. Introduction | 2003-10-29 | Paper |
| Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities. | 2002-09-15 | Paper |
| Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation | 2002-08-20 | Paper |
| Separating capacity constraints in the CVRP using tabu search | 2002-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532225 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234150 | 1999-11-02 | Paper |
| A remark on ``Integer linear programming formulation for a vehicle routing problem by N. R. Achutan and L. Caccetta, or how to use the Clark \(\&\) Wright savings to write such integer linear programming formulations | 1994-10-17 | Paper |
| The graphical relaxation: A new framework for the symmetric traveling salesman polytope | 1993-06-29 | Paper |
| The Binested Inequalities for the Symmetric Traveling Salesman Polytope | 1993-03-01 | Paper |
| The Crown Inequalities for the Symmetric Traveling Salesman Polytope | 1993-01-16 | Paper |
| The traveling salesman problem in graphs with some excluded minors | 1992-06-28 | Paper |
| The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3973408 | 1992-06-26 | Paper |
| The Hirsch conjecture is true for (0,1)-polytopes | 1989-01-01 | Paper |
| One-pass batching algorithms for the one-machine problem | 1988-01-01 | Paper |
| Heuristic approach to the artificial intelligence design challenge | 1988-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 |
| Pancyclic properties of the graph of some 0-1 polyhedra | 1984-01-01 | Paper |
| Hamiltonicity in (0-1)-polyhedra | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318811 | 1984-01-01 | Paper |
| Halin graphs and the travelling salesman problem | 1983-01-01 | Paper |
| Rank of maximum matchings in a graph | 1982-01-01 | Paper |
| Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings | 1982-01-01 | Paper |
| Hamiltonicity and combinatorial polyhedra | 1981-01-01 | Paper |
| Matchings in regular graphs | 1981-01-01 | Paper |
| Independence systems with continuous cardinality of bases | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3853637 | 1978-01-01 | Paper |
