Author of the publication

A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs.

, , and . ACM Journal of Experimental Algorithmics, 21 (1): 1.2:1-1.2:16 (2016)

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

A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations., , and . SEA, volume 103 of LIPIcs, page 11:1-11:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Polyhedral results on the stable set problem in graphs containing even or odd pairs., , and . Math. Program., 171 (1-2): 519-522 (2018)The strength of Dantzig-Wolfe reformulations for the stable set and related problems., and . Discret. Optim., (2018)A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs., , and . SEA, volume 8504 of Lecture Notes in Computer Science, page 34-45. Springer, (2014)A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs., , and . ACM Journal of Experimental Algorithmics, 21 (1): 1.2:1-1.2:16 (2016)Separation of Generic Cutting Planes in Branch-and-Price Using a Basis., and . SEA, volume 9125 of Lecture Notes in Computer Science, page 110-121. Springer, (2015)Avoiding redundant columns by adding classical Benders cuts to column generation subproblems., , and . Discret. Optim., (2021)