Zimmermann, Uwe (1984) Submodulare Flüsse: Verfahren zur Minimierung linearer Zielfunktionen.
Technical Report , 40 p.

Kern, Walter (1989) A Probabilistic Analysis of the Switching Algorithm for the Euclidean TSP.
Published in: Mathematical programming : Series A Vol. 44 (1-3). pp. 213-219.

Leclerc, Matthias (1989) Optimizing over a slice of the bipartite matching polytope.
Published in: Discrete mathematics Vol. 73 (1-2). pp. 159-162.

Hohmann, C. and Kern, Walter (1990) Optimization and optimality test for the Max-Cut Problem.
Published in: Zeitschrift für Operations-Research : ZOR ; mathematical methods of operations research Vol. 34 (3). pp. 195-206.

Leclerc, Matthias and Rendl, Franz (1989) A Multiply Constrained Matroid Optimization Problem.
Published in: Discrete mathematics Vol. 73 (1-2). pp. 207-212.

Leclerc, Matthias and Rendl, Franz (1989) Constrained Spanning Trees and the Travelling Salesman Problem.
Published in: European journal of operational research Vol. 39 (1). pp. 96-102.

Srivastav, Anand and Stangier, Peter (1993) Integer Multicommodity Flows with Reduced Demands.
Published In: AlgorithmsESA '93 : First Annual European Symposium Bad Honnef, Germany September 30 - October 2, 1993 Proceedings, Lecture notes in computer science. 726 Springer 1993, pp. 360-371.

Srivastav, Anand and Stangier, Peter (1996) Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming.
Published in: Random structures & algorithms Vol. 8 (1). pp. 27-58.

Bauer, Petra (1997) The Circuit Polytope: Facets.
Published in: Mathematics of operations research Vol. 22 (1). pp. 110-145.

Moll, Christoph (1995) Das inverse Kürzeste-Wege-Problem. PhD thesis.

Fekete, Sandor P. and Klemmstein, Monika (1995) Worst-case ratios for degree-constrained trees.
Published In: Proceedings of the 4th Biannual Twente Workshop on Graph Theory and Discrete Optimization 1995, pp. 103-106.

Fekete, Sandor P. and Khuller, Samir and Klemmstein, Monika and Raghavachari, Balaji and Young, Neal (1996) A network-flow technique for finding low-weight bounded-degree spanning trees.
Published In: Integer programming and combinatorial optimization : 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3 - 5, 1996 ; proceedings, Lecture notes in computer science. 1084 Springer 1996, pp. 105-117.

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1996) On Computing a Maximal Planar Subgraph using PQ-Trees.
Technical Report , 12 p.

Hamacher, Anja and Moll, Christoph (1997) A New Heuristic for Vehicle Routing with Narrow Time Windows.
Published In: Selected papers of the Symposium on Operations Research (SOR) : Braunschweig, September 3 - 6, 1996 Springer 1997, pp. 301-306.

Arkin, Esther M. and Fekete, Sandor P. and Mitchell, Joseph S. B. (2000) Approximation algorithms for lawn mowing and milling.
Published in: Computational geometry : theory and applications Vol. 17 (1-2). pp. 25-50.

Schepers, Jörg (1997) An Exact Algorithm for General Orthogonal n-dimensional Knapsack Problems.
Published In: Selected papers of the Symposium on Operations Research (SOR) : Braunschweig, September 3 - 6, 1996 Springer 1997, pp. 129-133.

Schepers, Jörg (1997) Exakte Algorithmen für orthogonale Packungsprobleme. PhD thesis.

Wottawa, Michael (1996) Struktur und algorithmische Behandlung von praxisorientierten dreidimensionalen Packungsproblemen. PhD thesis.

Buchheim, Christoph and Jünger, Michael (2002) Detecting Symmetries by Branch & Cut (Extended Abstract).
Published In: Graph drawing : 9th international symposium, GD 2001, Vienna, Austria, September 23 - 26, 2001 ; revised papers, Lecture Notes in Computer Science. 2265 Springer 2002, pp. 496-498.

Buchheim, Christoph and Jünger, Michael (2003) Detecting Symmetries by Branch & Cut (Journal Version).
Published in: Mathematical Programming B Vol. 98 (1-3). pp. 369-384.

Buchheim, Christoph and Chimani, Markus and Ebner, Dietmar and Gutwenger, Carsten and Jünger, Michael and Klau, Gunnar W. and Mutzel, Petra and Weiskircher, René (2008) A branch-and-cut approach to the crossing number problem.
Published in: Discrete optimization Vol. 5 (2). pp. 373-388.

Fanghänel, Diana and Liers, Frauke (2008) A Fast Exact Algorithm for the Optimum Cooperation Problem.
Technical Report , 14 p.

Fanghänel, Diana and Liers, Frauke (2010) A Fast Exact Algorithm for the Problem of Optimum Cooperation and Structure of Its Solutions.
Published in: Journal of Combinatorial Optimization Vol. 19 (3). pp. 369-393.

Liers, Frauke and Pardella, Gregor (2008) A simple MAX-CUT algorithm for planar graphs.
Technical Report , 16 p.

Liers, Frauke and Pardella, Gregor (2012) Partitioning planar graphs: a fast combinatorial approach for max-cut.
Published in: Computational Optimization and Applications. pp. 323-344.

Liers, Frauke and Nieberg, Tim and Pardella, Gregor (2011) Via Minimization in VLSI Chip Design - Application of a Planar Max-Cut Algorithm.
Technical Report , 15 p.

Lückerath, Daniel and Ullrich, Oliver and Speckenmeyer, Ewald (2013) Applicability of rescheduling strategies in tram networks.
Published In: Proceedings of ASIM-Treffen STS/GMMS 2013, ASIM-Mitteilungen. AM 145 ARGESIM/ASIM Pub., TU Vienna/Austria. Reichardt, R. (Ed.) February 2013.

Schrader, Rainer (1983) Approximations to partitioning and subgraph problems on trees.
Published in: Discrete Applied Mathematics Vol. 6 (3). pp. 301-309.

Derigs, Ulrich and Goecke, Oskar and Schrader, Rainer (1986) Monge sequences and a simple assignment algorithm.
Published in: Discrete Applied Mathematics Vol. 15 (2-3). pp. 241-248.

Faigle, Ulrich and Schrader, Rainer and Suletzki, R. (1987) A cutting plane algorithm for optimal graph partitioning.
Published in: Methods of Operations Research Vol. 57. pp. 109-116.

Cacchiani, Valentina and Jünger, Michael and Liers, Frauke and Lodi, Andrea and Schmidt, Daniel R. (2014) Single-Commodity Robust Network Design with Finite and Hose Demand Sets.
Technical Report , 32 p.
Submitted

Álvarez-Miranda, Eduardo and Cacchiani, Valentina and Lodi, Andrea and Parriani, Tiziano and Schmidt, Daniel R. (2014) Single-commodity robust network design problem: Complexity, instances and heuristic solutions.
Published in: European Journal of Operational Research Vol. 238 (3). pp. 711-723. ISSN 0377-2217

Barahona, Francisco and Jünger, Michael and Reinelt, Gerhard (1989) Experiments in Quadratic 0–1 Programming.
Published in: Mathematical Programming Vol. 44 (1-3). pp. 127-137. ISSN 0025-5610

Reinelt, Gerhard and Jünger, Michael and Grötschel, Martin (1989) Via Minimization with Pin Preassignments and Layer Preferal.
Published in: ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik Vol. 69 (11). pp. 393-399.

Grötschel, Martin and Jünger, Michael and Reinelt, Gerhard (1984) A Cutting Plane Algorithm for the Linear Ordering Problem.
Published in: Operations Research Vol. 32 (6). pp. 1195-1220.

Jünger, Michael and Reinelt, Gerhard and Rinaldi, Giovanni (1995) The Traveling Salesman Problem.
Published in: The Traveling Salesman Problem., Handbooks in Operations Reserach and Management Sciences. Elsevier 1995, pp. 225-330.

Cacchiani, Valentina and Jünger, Michael and Liers, Frauke and Lodi, Andrea and Schmidt, Daniel R. (2016) Single-commodity robust network design with finite and Hose demand sets.
Published in: Mathematical Programming Vol. 157 (1). pp. 297-342. ISSN 0025-5610

Srivastav, Anand and Stangier, Peter (1996) Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming.
Published In: Algorithms and Computation : 5th International Symposium, ISAAC '94 Beijing, P. R. China, August 2527, 1994 Proceedings, Lecture notes in computer science. 834 Springer 1996, pp. 226-233.

Fekete, Sandor P. and Khuller, Samir and Klemmstein, Monika and Raghavachari, Balaji and Young, Neal (1997) A network-flow technique for finding low-weight bounded-degree spanning trees.
Published in: Journal of Algorithms Vol. 24 (2). pp. 310-324.