Author of the publication

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.

 

Other publications of authors with the same name

AGD - A Library of Algorithms for Graph Drawing., , , and . Graph Drawing Software, Springer, (2004)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)McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems., , , and . ALENEX, page 54-66. SIAM, (2022)Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization, , and . Combinatorial Optimization, DIMACS Series in Discrete Mathematics and Computer Science, (1995)A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width., , and . J. Graph Algorithms Appl., 23 (3): 499-524 (2019)Handbooks in Operations Research and Management Science, , and . Volume 7, chapter Chapter 4 The traveling salesman problem, page 225--330. Elsevier, (1995)More Compact Orthogonal Drawings by Allowing Additional Bends †., , and . Information, 9 (7): 153 (2018)A Diagramming Software for UML Class Diagrams., , , , , and . Graph Drawing Software, Springer, (2004)A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints., , and . Comput. Optim. Appl., 17 (1): 61-84 (2000)