Up a level |
Bonato, Thorsten, Jünger, Michael, Reinelt, Gerhard and Rinaldi, Giovanni ORCID: 0000-0003-0148-2470 (2013). Lifting and Separation Procedures for the Cut Polytope. Mathematical Programming A. Springer.
Christof, Thomas, Jünger, Michael, Kececioglu, John, Mutzel, Petra ORCID: 0000-0001-7621-971X and Reinelt, Gerhard (1997). A branch-and-cut approach to physical mapping with end-probes. ACM. Working Paper.
Jünger, Michael and Reinelt, Gerhard (2001). Combinatorial Optimization and Integer Programming. Oxford: Eolss Publishers.
Jünger, Michael, Reinelt, Gerhard ORCID: 0000-0002-7193-501X and Rinaldi, Giovanni (1995). The Traveling Salesman Problem. Elsevier. ["eprint_fieldopt_monograph_type_preprint" not defined].
Jünger, Michael, Reinelt, Gerhard and Thienel, Stefan (1995). Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization. American Math. Soc. ["eprint_fieldopt_monograph_type_preprint" not defined].
Jünger, Michael, Reinelt, Gerhard ORCID: 0000-0002-7193-501X and Thienel, Stefan (1994). Provably good solutions for the traveling salesman problem. Physica-Verl.. ["eprint_fieldopt_monograph_type_preprint" not defined].
Simone, Caterina De, Diehl, Martin, Jünger, Michael, Mutzel, Petra ORCID: 0000-0001-7621-971X, Reinelt, Gerhard and Rinaldi, Giovanni (1995). Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm. Journal of statistical physics, 80 (1-2). pp. 487-496. Springer.