Phillippe Samer

The matching relaxation for a class of generalized set partitioning problems

Sebastián Urrutia, Johan Oppen, Phillippe Samer, 2019, Discret. Appl. Math..

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.

A combinatorial relaxation methodology for berth allocation problems pdf

Sebastián Urrutia, Johan Oppen, Phillippe Samer, 2016, ArXiv.

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

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

Combinatorial Relaxation Bounds and Preprocessing for Berth Allocation Problems

Sebastián Urrutia, Johan Oppen, Phillippe Samer, 2016, Electron. Notes Discret. Math..

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

Sebastián Urrutia, Rafael A. Melo, Phillippe Samer, 2016, Comput. Optim. Appl..

Fixed cardinality stable sets

Dag Haugland, Phillippe Samer, 2021, Discret. Appl. Math..