Phillippe Samer

发表

Towards Stronger Lagrangean Bounds for Stable Spanning Trees

D. Haugland, Phillippe Samer, 2022, INOC.

An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices

Rafael A. Melo, S. Urrutia, Phillippe Samer, 2016, Computational Optimization and Applications.

Polyhedral results and stronger Lagrangean bounds for stable spanning trees

D. Haugland, Phillippe Samer, 2022, Optimization Letters.

A branch and cut algorithm for minimum spanning trees under conflict constraints

S. Urrutia, Phillippe Samer, 2014, Optimization Letters.

A branch and cut algorithm for minimum spanning trees under conflict constraints

Sebastián Urrutia, Phillippe Samer, S. Urrutia, 2013, Optim. Lett..

Designing a Multicore Graph Library

Afonso H. Sampaio, Sebastián Urrutia, Anolan Milanés, 2012, 2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications.