Publications of M. Jünger

This page shows all publications that appeared in the IASI annual research reports. Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with author names.

Show all publications of the year  ALL, with author Jünger M., in the category Articles in Journals, Collections and Proceedings (or show them all):   (Items found: 14)


2021 | 2014 | 2004 | 2003 | 2001 | 2000 | 1998 | 1997 | 1996 | 1995

2021  [top]

2014  [top]

2004  [top]
  • Liers F., Jünger M., Reinelt G., Giovanni Rinaldi: Computing exact ground states of hard Ising spin glass problems by branch-and-cut, in: New Optimization Algorithms in Physics, Hartmann A.K., Rieger H. eds., Wiley-VCH Verlag, 47-69, 2004

2003  [top]

2001  [top]
  • Elf M., Gutwenger C., Jünger M., Giovanni Rinaldi: Branch-and-Cut Algorithms for Combinatorial Optimization and their Implementation in ABACUS, Jünger M., Naddef D. eds., Lecture Notes in Computer Science, 2241, Springer-Verlag, 157-222, 2001

2000  [top]

1998  [top]
  • Jünger M., Giovanni Rinaldi: Relaxations of the Max Cut Problem and Computation of Spin Glass Ground States, in the Proceedings of SOR '97, Kischka P., others eds., Operations Research Proceedings, 1998

1997  [top]
  • De Simone C., Jünger M.: On the two-connected planar spanning subgraph polytope, Discrete Applied Mathematics 80, 223-229, 1997
  • Jünger M., Reinelt G., Giovanni Rinaldi: The Traveling Salesman Problem, in: Annotated Bibliographies in Combinatorial Optimization, Dell'Amico M., Maffioli F., Martello S. eds., John Wiley and Sons, Inc., 199-221, 1997
  • Jünger M., Giovanni Rinaldi: Relaxations of the Max Cut Problem and Computation of Spin Glass Ground States, in the Proceedings of SOR'97, Lorenz A.-W., Kischka P. eds., Operations Research Proceedings, 1997

1996  [top]

1995  [top]
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -