( en | de | ru )

 

Disambiguation of "Jünger, Michael"

Author of the publication

copydeleteadd this publication to your clipboard
Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization.

, and . ESA, volume 144 of LIPIcs, page 63:1-63:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michael Jünger

Michael Jünger

Michael Jünger

Michael Jünger

Michael Ludwig Jünger

 

Other publications of authors with the same name

Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization., and . INFORMS J. Comput., 33 (4): 1419-1430 (2021)Introduction., and . Graph Drawing Software, Springer, (2004)AGD - A Library of Algorithms for Graph Drawing., , , and . Graph Drawing Software, Springer, (2004)McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems., , , and . ALENEX, page 54-66. SIAM, (2022)Caesar Automatic Layout of UML Class Diagrams., , , , , and . GD, volume 2265 of Lecture Notes in Computer Science, page 461-462. Springer, (2001)AGD: A Library of Algorithms for Graph Drawing., , , , , and . GD, volume 2265 of Lecture Notes in Computer Science, page 473-474. Springer, (2001)Graph Drawing: Exact Optimization Helps!, and . The Sharpest Cut, volume 4 of MPS-SIAM series on optimization, SIAM, (2004)Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization, , and . Combinatorial Optimization, DIMACS Series in Discrete Mathematics and Computer Science, (1995)2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms., and . J. Graph Algorithms Appl., 1 (1): 1-25 (1997)A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width., , and . J. Graph Algorithms Appl., 23 (3): 499-524 (2019)