Author of the publication

LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison.

, , , and . Math. Program. Comput., 4 (3): 275-306 (2012)

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

Fixing Variables in Semidefinite Relaxations.. ESA, volume 1284 of Lecture Notes in Computer Science, page 259-270. Springer, (1997)A spectral bundle method with bounds., and . Math. Program., 93 (2): 173-194 (2002)On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations., , and . SIAM Journal on Optimization, 23 (2): 834-856 (2013)Network Models with Convex Cost Structure like Bundle Methods.. Models and Algorithms for Optimization in Logistics, volume 09261 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs., , and . SIAM J. Discrete Math., 31 (2): 1196-1216 (2017)A Case Study of Joint Online Truck Scheduling and Inventory Management for Multiple Warehouses., and . Operations Research, 55 (4): 733-752 (2007)Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation., , , and . ATMOS, volume 9 of OASIcs, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2008)Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling., and . ATMOS, volume 14 of OASIcs, page 45-60. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, (2010)Fixing Variables in Semidefinite Relaxations.. SIAM J. Matrix Analysis Applications, 21 (3): 952-969 (2000)The rotational dimension of a graph., , and . Journal of Graph Theory, 66 (4): 283-302 (2011)