Michael Jünger
Michael Jünger
Verified email at
Cited by
Cited by
The traveling salesman problem
M Jünger, G Reinelt, G Rinaldi
Handbooks in operations research and management science 7, 225-330, 1995
An application of combinatorial optimization to statistical physics and circuit layout design
F Barahona, M Grötschel, M Jünger, G Reinelt
Operations Research 36 (3), 493-513, 1988
50 Years of integer programming 1958-2008: From the early years to the state-of-the-art
M Jünger, TM Liebling, D Naddef, GL Nemhauser, WR Pulleyblank, ...
Springer Science & Business Media, 2009
A cutting plane algorithm for the linear ordering problem
M Grötschel, M Jünger, G Reinelt
Operations research 32 (6), 1195-1220, 1984
Drawing large graphs with a potential-field-based multilevel algorithm
S Hachul, M Jünger
International Symposium on Graph Drawing, 285-295, 2004
2-layer straightline crossing minimization: Performance of exact and heuristic algorithms
M Jünger, P Mutzel
Graph algorithms and applications i, 3-27, 2002
Graph drawing software
M Jünger, P Mutzel
Springer Science & Business Media, 2012
Experiments in quadratic 0–1 programming
F Barahona, M Jünger, G Reinelt
Mathematical programming 44 (1), 127-137, 1989
Facets of the linear ordering polytope
M Grötschel, M Jünger, G Reinelt
Mathematical programming 33, 43-60, 1985
The Open Graph Drawing Framework (OGDF).
M Chimani, C Gutwenger, M Jünger, GW Klau, K Klein, P Mutzel
Handbook of graph drawing and visualization 2011, 543-569, 2013
Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm
C De Simone, M Diehl, M Jünger, P Mutzel, G Reinelt, G Rinaldi
Journal of Statistical Physics 80, 487-496, 1995
A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints
N Ascheuer, M Jünger, G Reinelt
Computational Optimization and Applications 17, 61-84, 2000
On the acyclic subgraph polytope
M Grötschel, M Jünger, G Reinelt
Mathematical Programming 33, 28-42, 1985
Practical problem solving with cutting plane algorithms in combinatorial optimization
M Jünger, G Reinelt, S Thienel
American Math. Soc 20 (20), 111-152, 1995
An experimental comparison of fast algorithms for drawing general large graphs
S Hachul, M Jünger
International Symposium on Graph Drawing, 235-250, 2005
The critical exponents of the two-dimensional Ising spin glass revisited: exact ground-state calculations and Monte Carlo simulations
H Rieger, L Santen, U Blasum, M Diehl, M Jünger, G Rinaldi
Journal of Physics A: Mathematical and General 29 (14), 3939, 1996
The ABACUS system for branch‐and‐cut‐and‐price algorithms in integer programming and combinatorial optimization
M Jünger, S Thienel
Software: Practice and Experience 30 (11), 1325-1352, 2000
Maximum planar subgraphs and nice embeddings: Practical layout tools
M Jünger, P Mutzel
Algorithmica 16, 33-59, 1996
A new approach for visualizing UML class diagrams
C Gutwenger, M Jünger, K Klein, J Kupke, S Leipert, P Mutzel
Proceedings of the 2003 ACM symposium on Software visualization, 179-188, 2003
Level planarity testing in linear time
M Jünger, S Leipert, P Mutzel
Graph Drawing: 6th International Symposium, GD’98 Montréal, Canada, August …, 1998
The system can't perform the operation now. Try again later.
Articles 1–20